Global convergence of a class of smooth penalty methods for semi-infinite programming
From MaRDI portal
Publication:1937778
DOI10.1007/s11424-011-8427-3zbMath1282.90207OpenAlexW2042983501MaRDI QIDQ1937778
Publication date: 31 January 2013
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-011-8427-3
Cites Work
- Unnamed Item
- 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
- A nonlinear programming algorithm based on non-coercive penalty functions
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Numerical experiments in semi-infinite programming
- Smoothing methods for convex inequalities and linear complementarity problems
- 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
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- Weak Sharp Minima in Mathematical Programming
- An iterative method for solving KKT system of the semi-infinite programming
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Penalty and Barrier Methods: A Unified Framework
- Non-Linear Programming Via Penalty Functions
This page was built for publication: Global convergence of a class of smooth penalty methods for semi-infinite programming
