New Farkas-type constraint qualifications in convex infinite programming
Open Access
- 20 June 2007
- journal article
- research article
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 13 (3) , 580-597
Abstract
This paper provides KKT and saddle point optimality conditions, duality theorems and stability theorems for consistent convex optimization problems posed in locally convex topological vector spaces. The feasible sets of these optimization problems are formed by those elements of a given closed convex set which satisfy a (possibly infinite) convex system. Moreover, all the involved functions are assumed to be convex, lower semicontinuous and proper (but not necessarily real-valued). The key result in the paper is the characterization of those reverse-convex inequalities which are consequence of the constraints system. As a byproduct of this new versions of Farkas' lemma we also characterize the containment of convex sets in reverse-convex sets. The main results in the paper are obtained under a suitable Farkas-type constraint qualifications and/or a certain closedness assumption.Keywords
This publication has 21 references indexed in Scilit:
- Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite ProgrammingJournal of Optimization Theory and Applications, 2005
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach SpaceSIAM Journal on Optimization, 2005
- Farkas-Type Results With Conjugate FunctionsSIAM Journal on Optimization, 2005
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex ConstraintsSIAM Journal on Optimization, 2003
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex ProgramsSIAM Journal on Optimization, 2003
- Locally Farkas–Minkowski Systems in Convex Semi-Infinite ProgrammingJournal of Optimization Theory and Applications, 1999
- Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex ProgramsJournal of Optimization Theory and Applications, 1997
- Inequality Systems and Global OptimizationJournal of Mathematical Analysis and Applications, 1996
- Results of farkas typeNumerical Functional Analysis and Optimization, 1987
- On Representations of Semi-Infinite Programs which Have No Duality GapsManagement Science, 1965