Solving Semi-infinite Optimization Problems with Quadratic Rate of Convergence
Seiten
2020
Fraunhofer Verlag
978-3-8396-1591-1 (ISBN)
Fraunhofer Verlag
978-3-8396-1591-1 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
We introduce a new adaptive discretization method solving semi-infinite optimization problems with a quadratic rate of convergence. We prove the Quadratic Convergence Theorem, which rigorously establishes quadratic convergence under mild regularity conditions and investigate further convergence properties. Numerical studies show that the new method outperforms the classical adaptive discretization method by Blankenship and Falk.
Semi-infinite programming can be used to model a large variety of complex optimization problems. Interesting applications include cutting and packing, or coverage problems. The simple description of such problems comes at a price: semi-infinite problems are often harder to solve than finite nonlinear problems. In this thesis we solve semi-infinite optimization problems using adaptive discretization methods having a quadratic rate of convergence. First, we investigate the classical Blankenship and Falk algorithm. We present an example which shows that quadratic convergence is not possible for a minimum of order higher than one. Motivated by this example we suggest a new adaptive discretization algorithm with guaranteed quadratic convergence. This rate holds even for minima of order higher than one. We prove the Quadratic Convergence Theorem, which rigorously establishes quadratic convergence under mild regularity conditions and investigate further convergence properties.
We compare the Blankenship and Falk algorithm to our new method by considering a series of numerical examples. In these examples, our new method outperforms the Blankenship and Falk algorithm.
Semi-infinite programming can be used to model a large variety of complex optimization problems. Interesting applications include cutting and packing, or coverage problems. The simple description of such problems comes at a price: semi-infinite problems are often harder to solve than finite nonlinear problems. In this thesis we solve semi-infinite optimization problems using adaptive discretization methods having a quadratic rate of convergence. First, we investigate the classical Blankenship and Falk algorithm. We present an example which shows that quadratic convergence is not possible for a minimum of order higher than one. Motivated by this example we suggest a new adaptive discretization algorithm with guaranteed quadratic convergence. This rate holds even for minima of order higher than one. We prove the Quadratic Convergence Theorem, which rigorously establishes quadratic convergence under mild regularity conditions and investigate further convergence properties.
We compare the Blankenship and Falk algorithm to our new method by considering a series of numerical examples. In these examples, our new method outperforms the Blankenship and Falk algorithm.
| Erscheinungsdatum | 30.06.2020 |
|---|---|
| Zusatzinfo | num., mostly col. illus. and tab. |
| Verlagsort | Stuttgart |
| Sprache | englisch |
| Maße | 148 x 210 mm |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Schlagworte | B • discretization • Fraunhofer ITWM • Informatiker • Mathematical theory of computation • Mathematiker • Maths for engineers • Numerical analysis • Rate of Convergence • semi-infinite programming • stationary points • Strong stability • Verfahrensingenieur • Verfahrensingenieure |
| ISBN-10 | 3-8396-1591-7 / 3839615917 |
| ISBN-13 | 978-3-8396-1591-1 / 9783839615911 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
für Ingenieure und Naturwissenschaftler
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 48,95
Buch | Softcover (2025)
Springer Vieweg (Verlag)
CHF 62,95
Buch | Softcover (2025)
Springer Fachmedien Wiesbaden (Verlag)
CHF 69,95
