A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
From MaRDI portal
Publication:1433470
DOI10.1007/BF02578953zbMath1069.90101MaRDI QIDQ1433470
Edite M. G. P. Fernandes, A. Ismael F. Vaz, M. Paula S. F. Gomes
Publication date: 18 June 2004
Published in: Top (Search for Journal in Brave)
49M29: Numerical methods involving duality
90C20: Quadratic programming
49M37: Numerical methods based on nonlinear programming
90C34: Semi-infinite programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- A note on an implementation of a method for quadratic semi-infinite programming
- Globally convergent methods for semi-infinite programming
- Discretization methods for the solution of semi-infinite programming problems
- Numerical experiments in semi-infinite programming
- A perturbation method for solving linear semi-infinite programming problems
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- An implementation of a discretization method for semi-infinite programming
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- A dual parameterization approach to linear-quadratic semi-infinite programming problems
- Numerical Optimization
- CUTE
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- SIPAMPL
- Nonlinear programming without a penalty function.