On constraint qualifications of a nonconvex inequality
From MaRDI portal
(Redirected from Publication:723504)
Abstract: In this paper, we study constraint qualifications for the nonconvex inequality defined by a proper lower semicontinuous function. These constraint qualifications involve the generalized construction of normal cones and subdifferentials. Several conditions for these constraint qualifications are also provided therein. When restricted to the convex inequality, these constraint qualifications reduce to basic constraint qualification (BCQ) and strong BCQ studied in [SIAM J. Optim., 14(2004), 757-772] and [Math. Oper. Res., 30 (2005), 956-965].
Recommendations
- Characterizations of the Strong Basic Constraint Qualifications
- Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces
- On strong and total Lagrange duality for convex optimization problems
- Some constraint qualifications for quasiconvex vector-valued systems
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Strong Abadie CQ, ACQ, calmness and linear regularity
- An alternative formulation for a new closed cone constraint qualification
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1303653 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- A dual condition for the convex subdifferential sum formula with applications
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces
- Characterizations of the Strong Basic Constraint Qualifications
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Constraint qualifications for semi-infinite systems of convex inequalities
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- Farkas-type results and duality for DC programs with convex constraints
- Local and global optimality conditions for dc infinite optimization problems
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Metric Subregularity and Constraint Qualifications for Convex Generalized Equations in Banach Spaces
- New Farkas-type constraint qualifications in convex infinite programming
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
- On metric subregularity for convex constraint systems by primal equivalent conditions
- Optimization and nonsmooth analysis
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Regularities and their relations to error bounds
- Stable Lagrange dualities for robust conical programming
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Variational Analysis
Cited in
(15)- On constraint qualifications in nonlinear programming
- On nonconvex version of the inequality of Clarke and Ledyaev
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- scientific article; zbMATH DE number 7733461 (Why is no real title available?)
- scientific article; zbMATH DE number 6453520 (Why is no real title available?)
- scientific article; zbMATH DE number 7347532 (Why is no real title available?)
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- On several types of basic constraint qualifications via coderivatives for generalized equations
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- scientific article; zbMATH DE number 6729884 (Why is no real title available?)
- A Clarke-Ledyaev type inequality for certain non-convex sets
- Characterizations of the Strong Basic Constraint Qualifications
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
This page was built for publication: On constraint qualifications of a nonconvex inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723504)
