An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
DOI10.1080/02331934.2020.1804566zbMath1493.90209arXiv1910.13798OpenAlexW3080602729MaRDI QIDQ5093681
Tobias Seidel, Karl-Heinz Küfer
Publication date: 1 August 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.13798
quadratic convergencesemi-infinite programmingstationary pointsdiscretization methodsbi-level optimization
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34) Rate of convergence, degree of approximation (41A25)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Feasible method for generalized semi-infinite programming
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Semi-infinite programming
- Infinitely constrained optimization problems
- Discretization methods for the solution of semi-infinite programming problems
- Semi-infinite optimization: Structure and stability of the feasible set
- Some outer approximation methods for semi-infinite optimization problems
- Optimization. Algorithms and consistent approximations
- Bi-level strategies in semi-infinite programming.
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- On existence and uniqueness of stationary points in semi-infinite optimization
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- How to solve a design centering problem
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Semi-Infinite Programming: Theory, Methods, and Applications
- Strongly Regular Generalized Equations
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Nonlinear Programming
- Discretization in semi-infinite programming: the rate of convergence
This page was built for publication: An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence