Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:The Projected Subgradient Algorithm In Convex OptimizationISBN13:9783030602994ISBN10:3030602990Author:Zaslavski, Alexander J. (Author)Description: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 DiErent Steps Are DiErent, 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 Binding:Paperback, PaperbackPublisher:SpringerPublication Date:2020-11-27Weight:0.5 lbsDimensions:Number of Pages:121Language:English
Price: 58.51 USD
Location: USA
End Time: 2024-05-05T11:06:54.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: The Projected Subgradient Algorithm In Convex Optimization
Item Length: 9.3in.
Item Width: 6.1in.
Author: Alexander J. Zaslavski
Publication Name: Projected Subgradient Algorithm in Convex Optimization
Format: Trade Paperback
Language: English
Publisher: Springer International Publishing A&G
Series: Springerbriefs in Optimization Ser.
Publication Year: 2020
Type: Textbook
Item Weight: 16 Oz
Number of Pages: VI, 146 Pages
