The Projected Subgradient Algorithm in Convex Optimization (SpringerBriefs in Optimization)
Language: English
Published by Springer, 2020
- Softcover
- New

Seller: Majestic Books, Hounslow, United KingdomMajestic Books
4-star seller
AbeBooks seller since January 19, 2007
Softcover
Condition: New
US$ 94.53
US$ 8.57 shipping
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Add to basketFree 30-day returns
Item description from seller
Print on Demand.
Seller Inventory # 391154026
- Title
- The Projected Subgradient Algorithm in Convex Optimization (SpringerBriefs in Optimization)
- Author
- Zaslavski, Alexander J.
- Publisher
- Springer
- Publication year
- 2020
- Condition
- New
- Binding
- Soft cover
- Language
- English
- ISBN 10
- 3030602990
- ISBN 13
- 9783030602994
- Series
- Book 38 of 43: SpringerBriefs in Optimization
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 different, in general. The book is especially useful for the reader because it contains solutions to a number of difficult and interesting problems in the numerical optimization. The subgradient projection algorithm is one of the most important tools in optimization theory and its applications. An optimization problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first step requires a calculation of a subgradient of the objective function; the second requires a calculation of a projection on the feasible set. The computational errors in each of these two steps are different. This book shows that the algorithm discussed, generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if computational errors for the two steps of the algorithm are known, one discovers an approximate solution and how many iterations one needs for this. In addition to their mathematical interest, the generalizations considered in this book have a significant practical meaning.
"Synopsis" may belong to another edition of this title.
About the Author
Alexander J. Zaslavski is professor in the Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel.
"About the title" may belong to another edition of this title.
Majestic Books
Hounslow, United Kingdom
4-star seller
AbeBooks seller since January 19, 2007
Shipping rates from United Kingdom to U.S.A.
| Item | 14 to 45 business days | 5 to 10 business days |
|---|---|---|
| First item | US$ 8.57 | US$ 12.99 |
Payment methods
Store description
We specialise in General Interest Books from South Asian countries.
Specialty
Art, Economics, Buddhism, Religion, Sociology, PaintingSeller's business information
BOOKS AND PERIODICALS AGENCY LTD
Unit 4 Alice way,
Hounslow, United Kingdom TW3 3UD
Terms of sale
Returns accepted if you are not satisfied with the Service or Book.
Shipping terms
Best packaging and fast delivery