Loading…
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...
Saved in:
Main Author: | |
---|---|
Corporate Author: | |
Format: | eBook |
Language: | English |
Published: |
Switzerland :
Springer,
2016.
|
Series: | Springer optimization and its applications ;
v. 108. |
Physical Description: |
1 online resource (ix, 304 pages). |
Subjects: | |
Online Access: | SpringerLink - Click here for access |
MARC
LEADER | 00000cam a2200000 i 4500 | ||
---|---|---|---|
001 | ocn947837426 | ||
003 | OCoLC | ||
005 | 20240329122006.0 | ||
006 | m o d | ||
007 | cr cnu|||unuuu | ||
008 | 160426s2016 sz ob 001 0 eng d | ||
015 | |a GBB900699 |2 bnb | ||
016 | 7 | |a 019188127 |2 Uk | |
020 | |a 9783319309217 |q (electronic bk.) | ||
020 | |a 3319309218 |q (electronic bk.) | ||
020 | |a 331930920X |q (print) | ||
020 | |a 9783319309200 |q (print) | ||
020 | |z 9783319309200 |q (print) | ||
024 | 7 | |a 10.1007/978-3-319-30921-7 |2 doi | |
035 | |a (OCoLC)947837426 | ||
037 | |a com.springer.onix.9783319309217 |b Springer Nature | ||
040 | |a N$T |b eng |e rda |e pn |c N$T |d GW5XE |d N$T |d IDEBK |d YDXCP |d CDX |d EBLCP |d VT2 |d COO |d OCLCF |d KSU |d IDB |d JG0 |d OCLCQ |d IAD |d JBG |d ICW |d Z5A |d ILO |d ICN |d FIE |d OCLCQ |d ESU |d IOG |d NJR |d U3W |d REB |d EZ9 |d WYU |d OCLCQ |d UKMGB |d LEAUB |d UKAHL |d OCLCQ |d AJS |d OCLCO |d OCLCQ |d OCLCO |d S9M |d OCLCL | ||
049 | |a COM6 | ||
050 | 4 | |a QA402.5 | |
072 | 7 | |a MAT |x 003000 |2 bisacsh | |
072 | 7 | |a MAT |x 029000 |2 bisacsh | |
082 | 0 | 4 | |a 519.6 |2 23 |
100 | 1 | |a Zaslavski, Alexander J., |0 https://id.loc.gov/authorities/names/n2005048531 |e author. | |
245 | 1 | 0 | |a Numerical optimization with computational errors / |c Alexander J. Zaslavski. |
264 | 1 | |a Switzerland : |b Springer, |c 2016. | |
300 | |a 1 online resource (ix, 304 pages). | ||
336 | |a text |b txt |2 rdacontent. | ||
337 | |a computer |b c |2 rdamedia. | ||
338 | |a online resource |b cr |2 rdacarrier. | ||
347 | |a text file. | ||
347 | |b PDF. | ||
490 | 1 | |a Springer optimization and its applications, |x 1931-6828 ; |v volume 108. | |
504 | |a Includes bibliographical references and index. | ||
588 | 0 | |a Online resource; title from PDF title page (SpringerLink, viewed April 26, 2016). | |
505 | 0 | |a 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. | |
520 | |a 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. | ||
650 | 0 | |a Mathematical optimization. |0 https://id.loc.gov/authorities/subjects/sh85082127. | |
650 | 6 | |a Optimisation mathématique. | |
650 | 7 | |a Numerical analysis. |2 bicssc. | |
650 | 7 | |a Operational research. |2 bicssc. | |
650 | 7 | |a Calculus of variations. |2 bicssc. | |
650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh. | |
650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh. | |
650 | 7 | |a Análisis numérico. |2 embne. | |
650 | 7 | |a Investigación operativa. |2 embne. | |
650 | 7 | |a Mathematical optimization. |2 fast. | |
710 | 2 | |a SpringerLink (Online service) |0 https://id.loc.gov/authorities/names/no2005046756. | |
776 | 0 | 8 | |i Printed edition: |z 9783319309200. |
830 | 0 | |a Springer optimization and its applications ; |0 https://id.loc.gov/authorities/names/no2006059964 |v v. 108. | |
907 | |a .b50790572 |b multi |c - |d 160608 |e 240516 | ||
998 | |a (3)cue |a cu |b 240404 |c m |d z |e - |f eng |g sz |h 0 |i 2 | ||
948 | |a MARCIVE Overnight, in 2024.04 | ||
948 | |a MARCIVE Overnight, in 2023.01 | ||
948 | |a MARCIVE Over, 07/2021 | ||
948 | |a MARCIVE Comp, 2019.12 | ||
948 | |a MARCIVE Comp, 2018.05 | ||
948 | |a MARCIVE August, 2017 | ||
948 | |a MARCIVE extract Aug 5, 2017 | ||
994 | |a 92 |b COM | ||
995 | |a Loaded with m2btab.ltiac in 2024.04 | ||
995 | |a Loaded with m2btab.elec in 2024.04 | ||
995 | |a Loaded with m2btab.ltiac in 2023.01 | ||
995 | |a Loaded with m2btab.ltiac in 2021.07 | ||
995 | |a Loaded with m2btab.elec in 2021.06 | ||
995 | |a Loaded with m2btab.ltiac in 2019.12 | ||
995 | |a Loaded with m2btab.ltiac in 2018.06 | ||
995 | |a Loaded with m2btab.ltiac in 2017.09 | ||
995 | |a Loaded with m2btab.elec in 2016 | ||
995 | |a Loaded with m2btab.elec in 2016 | ||
995 | |a Loaded with m2btab.elec in 2016 | ||
995 | |a OCLC offline update by CMU | ||
999 | |e z | ||
999 | |a cue | ||
989 | |d cueme |e - - |f - - |g - |h 0 |i 0 |j 200 |k 240404 |l $0.00 |m |n - - |o - |p 0 |q 0 |t 0 |x 0 |w SpringerLink |1 .i151456070 |u http://ezproxy.coloradomesa.edu/login?url=https://link.springer.com/10.1007/978-3-319-30921-7 |3 SpringerLink |z Click here for access |