New Farkas-type constraint qualifications in convex infinite programming

DOI10.1051/cocv:2007027zbMath1126.90059OpenAlexW2136553956MaRDI QIDQ5428420

No author found.

Publication date: 22 November 2007

Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=COCV_2007__13_3_580_0

zbMATH Keywords

duality theory convex infinite programming Farkas-type constraint qualification KKT and saddle point optimality conditions

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Semi-infinite programming (90C34)

Related Items

Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality ⋮ The stable duality of DC programs for composite convex functions ⋮ Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Optimality conditions in convex multiobjective SIP ⋮ Weaker conditions for subdifferential calculus of convex functions ⋮ An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Normal subdifferentials of efficient point multifunctions in parametric vector optimization ⋮ Clarke coderivatives of efficient point multifunctions in parametric vector optimization ⋮ A unifying approach to robust convex infinite optimization duality ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization ⋮ Recent contributions to linear semi-infinite optimization ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty ⋮ Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Stationarity and regularity of infinite collections of sets ⋮ Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian ⋮ Unnamed Item ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ New glimpses on convex infinite optimization duality ⋮ Optimality conditions for nonlinear infinite programming problems ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ Revisiting some rules of convex analysis ⋮ On strong and total Lagrange duality for convex optimization problems ⋮ Multiobjective DC programs with infinite convex constraints ⋮ Nonsmooth semi-infinite multiobjective optimization problems ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Semi-infinite optimization under convex function perturbations: Lipschitz stability ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ On constraint qualifications of a nonconvex inequality ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ Simple bilevel programming and extensions ⋮ Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ 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 ⋮ Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints ⋮ 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 ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ γ-Active Constraints in Convex Semi-Infinite Programming

Cites Work