Non-Fiction Books:

Separable Programming

Theory and Methods
Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Hardback
$268.99
RRP:
$383.95 save $114.96
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks

Buy Now, Pay Later with:

4 payments of $67.25 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 14-26 June using International Courier

Description

In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. Numerical approximation with respect to I1 and I4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well.
Release date Australia
May 31st, 2001
Author
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
  • Undergraduate
Illustrations
XIX, 314 p.
Pages
314
Dimensions
156x234x20
ISBN-13
9780792368823
Product ID
2051876

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...