A quasi-Newton interior point method for semi-infinite programming
From MaRDI portal
Publication:4650627
DOI10.1080/10556780310001634091zbMath1097.90065OpenAlexW2026551786MaRDI QIDQ4650627
Edite M. G. P. Fernandes, A. Ismeal F. Vaz, M. Paula S. F. Gomes
Publication date: 18 February 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780310001634091
Methods of quasi-Newton type (90C53) Interior-point methods (90C51) Semi-infinite programming (90C34)
Related Items (1)
Uses Software
Cites Work
- A computational algorithm for functional inequality constrained optimization problems
- A note on an implementation of a method for quadratic semi-infinite programming
- Globally convergent methods for semi-infinite programming
- An interior-point algorithm for nonconvex nonlinear programming
- Discretization methods for the solution of semi-infinite programming problems
- A new computational algorithm for functional inequality constrained optimization problems
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- 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
- A simple computational procedure for optimization problems with functional inequality constraints
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- Numerical Optimization
- Nonlinear programming without a penalty function.
This page was built for publication: A quasi-Newton interior point method for semi-infinite programming