Get Free Shipping on orders over $79
Separable Programming : Theory and Methods - S. M. Stefanov

Separable Programming

Theory and Methods

By: S. M. Stefanov

eText | 11 November 2013

At a Glance

eText


$159.01

or 4 interest-free payments of $39.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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. Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.
on
Desktop
Tablet
Mobile

More in Optimisation

AI Breaking Boundaries - Avinash Vanam

eBOOK

Epistemic Genres : New Formations of Play - Gerald A. Voorhees

eBOOK

RRP $171.00

$153.99

10%
OFF
Emerging Genres : New Formations of Games - Joshua Call

eBOOK

RRP $171.00

$153.99

10%
OFF