Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
From MaRDI portal
Publication:3608976
DOI10.1137/060676982zbMATH Open1170.90009OpenAlexW2092191703WikidataQ57511273 ScholiaQ57511273MaRDI QIDQ3608976FDOQ3608976
C. Li, K. F. Ng, Ting Kei Pong
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
Recommendations
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On constraint qualifications of a nonconvex inequality
conic programmingstrong conical hull intersection propertybest constrained approximationbasic constraint qualificationconvex inequality system
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Semi-infinite programming (90C34) Approximation with constraints (41A29)
Cited In (86)
- A note on nonconvex minimax theorem with separable homogeneous polynomials
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Title not available (Why is that?)
- Sufficient Optimality Conditions for a Robust Multiobjective Problem
- Sandwich theorem for quasiconvex functions and its applications
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
- Normal subdifferentials of efficient point multifunctions in parametric vector optimization
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- On set containment characterization and constraint qualification for quasiconvex programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Necessary and sufficient constraint qualification for surrogate duality
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Derivatives of the efficient point multifunction in parametric vector optimization problems
- On constraint qualifications of a nonconvex inequality
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- On approximate solutions for robust convex semidefinite optimization problems
- On several types of basic constraint qualifications via coderivatives for generalized equations
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality for robust linear infinite programming problems revisited
- Robust constrained best approximation with nonconvex constraints
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Duality theorems for separable convex programming without qualifications
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Constraint qualifications in convex vector semi-infinite optimization
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Strong and total Fenchel dualities for robust convex optimization problems
- Some constraint qualifications for quasiconvex vector-valued systems
- Characterizations of robust solution set of convex programs with uncertain data
- Robust optimization revisited via robust vector Farkas lemmas
- Duality theorems for convex and quasiconvex set functions
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Optimality conditions and total dualities for conic programming involving composite function
- Total Lagrange duality for DC infinite optimization problems
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Valid inequalities for separable concave constraints with indicator variables
- Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Recent contributions to linear semi-infinite optimization
- Clarke coderivatives of efficient point multifunctions in parametric vector optimization
- Optimality conditions for non-smooth semi-infinite programming
- Strong and total Lagrange dualities for quasiconvex programming
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint qualifications for semi-infinite systems of convex inequalities
- Title not available (Why is that?)
- Optimality conditions and constraint qualifications for quasiconvex programming
- Nonsmooth semi-infinite multiobjective optimization problems
- Recent contributions to linear semi-infinite optimization: an update
- Asymptotic optimality conditions for linear semi-infinite programming
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- An extension of the basic constraint qualification to nonconvex vector optimization problems
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- Title not available (Why is that?)
- Title not available (Why is that?)
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- On global error bounds for convex inequalities systems
- Alternative KKT conditions for (semi)infinite convex optimization
- Fuzzy and exact necessary optimality conditions for a nonsmooth bilevel semi-infinite program
- A new tour on the subdifferential of the supremum function
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Duality for constrained robust sum optimization problems
- Duality for the robust sum of functions
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
This page was built for publication: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608976)
