Separable Programming: Theory and Methods - Applied Optimization 53 (Hardback)Stefan M. Stefanov (author)
- We can order this
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.
Number of pages: 314
Weight: 1440 g
Dimensions: 235 x 155 x 20 mm
Edition: 2001 ed.
You may also be interested in...
Please sign in to write a review