Separable Programming - Applied Optimization - Stefan M. Stefanov - Grāmatas - Springer-Verlag New York Inc. - 9781441948519 - 2010. gada 6. decembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Separable Programming - Applied Optimization 1st Ed. Softcover of Orig. Ed. 2001 edition


Saņemt e-pastu, kad prece būs pieejama
Do you have a profile? Pierakstīties
Pievienot savam iMusic vēlmju sarakstam

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.


314 pages, biography

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2010. gada 6. decembris
ISBN13 9781441948519
Izdevēji Springer-Verlag New York Inc.
Lapas 314
Izmēri 156 × 234 × 18 mm   ·   476 g
Valoda Angļu  

Vairāk no Stefan M. Stefanov

Rādīt visu

Mere med samme udgiver