Order by 12PM ET on 6/11 for Delivery by Father's Day | Find a giftOrder by 12PM ET on 6/11 for Delivery by Father's Day | Find a gift

The Projected Subgradient Algorithm in Convex Optimization

Paperback
$54.99
Promotion message icon
Premium Members save an extra 10% and all Members collect stamps to save with Rewards. 10 stamps = $5.Learn More
In stock
This item is currently out of stock online.
Free standard shipping on orders over $60
Select a store to view item availability.
This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts in applications of optimization to engineering and economics. The goal is to obtain a good approximate solution of the problem in the presence of computational errors. The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for different steps are ...