An approximation of feasible sets in semi-infinite optimization.
From MaRDI portal
Publication:1871423
DOI10.1007/BF02579022zbMath1073.90045MaRDI QIDQ1871423
Jan-Joachim Rückmann, Francisco Guerra Vázquez
Publication date: 2002
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579022
semi-infinite optimization; extended Mangasarian-Fromovitz constraint qualification; (quadratic) distance function; approximation of feasible set
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
90C34: Semi-infinite programming
Related Items
Cites Work
- Metric regularity of the feasible set mapping in semi-infinite optimization
- Semi-infinite optimization: Structure and stability of the feasible set
- Optimization. Algorithms and consistent approximations
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- On existence and uniqueness of stationary points in semi-infinite optimization
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Semi-Infinite Programming: Theory, Methods, and Applications
- On stability and stationary points in nonlinear optimization
- Existence and Differentiability of Metric Projections in Hilbert Spaces
- One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
- Semi-infinite programming. Recent advances
- Unnamed Item
- Unnamed Item
- Unnamed Item
