S M Stefanov

(Author)

Separable Programming: Theory and Methods (2001)Hardcover - 2001, 31 May 2001

Separable Programming: Theory and Methods (2001)
Qty
1
Turbo
Ships in 2 - 3 days
In Stock
Free Delivery
Cash on Delivery
15 Days
Free Returns
Secure Checkout
Buy More, Save More
Part of Series
Applied Optimization
Part of Series
Developments in Plant Breeding
Part of Series
NATO Asi Series. 1. Disarmament Technologies
Part of Series
Applied Optimization Applied Optimization
Print Length
314 pages
Language
English
Publisher
Springer
Date Published
31 May 2001
ISBN-10
0792368827
ISBN-13
9780792368823

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.
Audience: Advanced undergraduate and graduate students, mathematical programming/ operations research specialists.

Product Details

Author:
S M Stefanov
Book Edition:
2001
Book Format:
Hardcover
Country of Origin:
US
Date Published:
31 May 2001
Dimensions:
24.64 x 16.36 x 2.34 cm
ISBN-10:
0792368827
ISBN-13:
9780792368823
Language:
English
Location:
New York, NY
Pages:
314
Publisher:
Weight:
644.1 gm

Related Categories


Need Help?
+971 6 731 0280
support@gzb.ae

About UsContact UsPayment MethodsFAQsShipping PolicyRefund and ReturnTerms of UsePrivacy PolicyCookie Notice

VisaMastercardCash on Delivery

© 2024 White Lion General Trading LLC. All rights reserved.