Asymptotic optimality conditions for linear semi-infinite programming
From MaRDI portal
Publication:2790886
DOI10.1080/02331934.2015.1051533zbMath1332.90321OpenAlexW1751473502MaRDI QIDQ2790886
Yanqun Liu, Miguel Angel Goberna
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/61929
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
Recent contributions to linear semi-infinite optimization, Recent contributions to linear semi-infinite optimization: an update, Optimality conditions for semi-infinite programming problems involving generalized convexity, Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
Cites Work
- A ladder method for linear semi-infinite programming
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- An exterior point linear programming method based on inclusive normal cones
- Duality in linear programming: from trichotomy to quadrichotomy
- Semi-infinite programming
- Locally Farkas-Minkowski linear inequality systems
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- An alternative formulation for a new closed cone constraint qualification
- γ-Active Constraints in Convex Semi-Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Extended Active Constraints in Linear Optimization with Applications
- Optimal control problems with unbounded constraint sets
- Uncertainty modelling and robust output feedback control of nonlinear discrete systems: a mathematical programming approach
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
- New Farkas-type constraint qualifications in convex infinite programming
- Perfect duality in semi-infinite and semidefinite programming
