Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
From MaRDI portal
Publication:3608976
DOI10.1137/060676982zbMath1170.90009OpenAlexW2092191703WikidataQ57511273 ScholiaQ57511273MaRDI QIDQ3608976
Chong Li, Ting Kei Pong, Ng Kung-fu
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060676982
conic programmingstrong conical hull intersection propertybest constrained approximationbasic constraint qualificationconvex inequality system
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 (71)
Duality theorems for separable convex programming without qualifications ⋮ Robust optimization revisited via robust vector Farkas lemmas ⋮ On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ On several types of basic constraint qualifications via coderivatives for generalized equations ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ An extension of the basic constraint qualification to nonconvex vector optimization problems ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ Normal subdifferentials of efficient point multifunctions in parametric vector optimization ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Clarke coderivatives of efficient point multifunctions in parametric vector optimization ⋮ Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ Duality for the robust sum of functions ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization ⋮ Recent contributions to linear semi-infinite optimization ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Sufficient Optimality Conditions for a Robust Multiobjective Problem ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Unnamed Item ⋮ Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty ⋮ Optimality conditions and the basic constraint qualification for quasiconvex programming ⋮ Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system ⋮ Some constraint qualifications for quasiconvex vector-valued systems ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Derivatives of the efficient point multifunction in parametric vector optimization problems ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ A note on nonconvex minimax theorem with separable homogeneous polynomials ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ Duality for constrained robust sum optimization problems ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Nonsmooth semi-infinite multiobjective optimization problems ⋮ Sandwich theorem for quasiconvex functions and its applications ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ Unnamed Item ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Robust constrained best approximation with nonconvex constraints ⋮ Duality for robust linear infinite programming problems revisited ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ 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 ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Strong and total Lagrange dualities for quasiconvex programming
This page was built for publication: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
