Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
From MaRDI portal
Publication:3586137
DOI10.1137/080739124zbMath1206.90198OpenAlexW2006581042WikidataQ125018216 ScholiaQ125018216MaRDI QIDQ3586137
Chong Li, Ng Kung-fu, Dong Hui Fang
Publication date: 6 September 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080739124
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Approximation with constraints (41A29) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items (48)
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality ⋮ Stable and total Fenchel duality for composed convex optimization problems ⋮ Farkas-type results for vector-valued functions with applications ⋮ Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ On several types of basic constraint qualifications via coderivatives for generalized equations ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Recent contributions to linear semi-infinite optimization ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ On a zero duality gap result in extended monotropic programming ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Unnamed Item ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ New glimpses on convex infinite optimization duality ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Strong duality and optimality conditions for generalized equilibrium problems ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ On constraint qualifications of a nonconvex inequality ⋮ Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems ⋮ Surrogate duality for robust optimization
This page was built for publication: Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
