Numerical optimization with computational errors / / by Alexander J. Zaslavski

• Autore: Zaslavski Alexander J
• Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
• Edizione: 1st ed. 2016.
• Descrizione fisica: 1 online resource (ix, 304 pages)
• Disciplina: 519.3
• Soggetto topico: Calculus of variations; Numerical analysis; Operations research; Management science; Calculus of Variations and Optimal Control; Optimization; Numerical Analysis; Operations Research, Management Science
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 1. Introduction -- 2. Subgradient Projection Algorithm -- 3. The Mirror Descent Algorithm -- 4. Gradient Algorithm with a Smooth Objective Function -- 5. An Extension of the Gradient Algorithm -- 6. Weiszfeld's Method -- 7. The Extragradient Method for Convex Optimization -- 8. A Projected Subgradient Method for Nonsmooth Problems -- 9. Proximal Point Method in Hilbert Spaces -- 10. Proximal Point Methods in Metric Spaces -- 11. Maximal Monotone Operators and the Proximal Point Algorithm -- 12. The Extragradient Method for Solving Variational Inequalities -- 13. A Common Solution of a Family of Variational Inequalities -- 14. Continuous Subgradient Method -- 15. Penalty Methods -- 16. Newton's method -- References -- Index. .
• Sommario/riassunto: 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.
• Titolo autorizzato: Numerical optimization with computational errors
• ISBN: 3-319-30921-8
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910254076803321
• Lo trovi qui: Univ. Federico II
• Serie: Springer Optimization and Its Applications, . 1931-6828 ; ; 108