Contact
How to shop
Delivery
Shopping guide
English
308 b
30-day return policy
Customers also purchased
/
Paperback
3 029
Ft
/
Paperback
5 705
Ft
/
Paperback
10 120
Ft
/
Paperback
3 970
Ft
/
Paperback
3 205
Ft
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 I 1 and I 4 norms, as a convex separable nonsmooth unconstrained minimization problem, is considered as well. §Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Cards
6 753
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?