Text
Numerical Optimization with Computational Errors
This book studies the approximate solutions of optimization problems in the presence of computational errors. A number of results are presented on the convergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative. This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton’s method.
Availability
No copy data
Detail Information
- Series Title
-
Springer Optimization and Its Applications
- Call Number
-
-
- Publisher
- Cham, Switzerland : Springer., 2016
- Collation
-
IX, 304
- Language
-
English
- ISBN/ISSN
-
978-3-319-30920-0
- Classification
-
NONE
- Content Type
-
text
- Media Type
-
computer
- Carrier Type
-
online resource
- Edition
-
1
- Subject(s)
- Specific Detail Info
-
-
- Statement of Responsibility
-
Alexander J. Zaslavski
Other Information
- Cataloger
-
Devi
- Source
-
-
- Validator
-
Taufik
Other version/related
No other version available
File Attachment
Comments
You must be logged in to post a comment
Computer Science, Information & General Works 
Philosophy & Psychology 
Religion 
Social Sciences 
Language 
Pure Science 
Applied Sciences 
Art & Recreation 
Literature 
History & Geography