Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications

DOI10.1137/130911287zbMath1298.90119OpenAlexW1984826350MaRDI QIDQ5408217

Publication date: 9 April 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130911287

zbMATH Keywords

semi-infinite programming Slater condition Farkas lemma strong Lagrangian duality FM qualification set containment characterization

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Approximation with constraints (41A29)

Related Items

Constraint qualifications in convex vector semi-infinite optimization ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Unnamed Item ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ Unnamed Item ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ On constraint qualifications of a nonconvex inequality ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators

This page was built for publication: Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications