An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems
From MaRDI portal
Publication:2829601
DOI10.1080/01630563.2016.1191033zbMath1348.90574MaRDI QIDQ2829601
Publication date: 8 November 2016
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2016.1191033
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
65D15: Algorithms for approximation of functions
Cites Work
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Discretization methods for the solution of semi-infinite programming problems
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- Generalized semi-infinite programming: numerical aspects
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- An iterative method for solving KKT system of the semi-infinite programming
- On Linear Semi-Infinite Programming Problems: An Algorithm
- A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
- A nonlinear programming approach to optimal design centering, tolerancing, and tuning
- Local Convergence of SQP Methods in Semi-Infinite Programming