On constraint qualifications of a nonconvex inequality
Given a convex continuous function \(\phi\) defined on a Banach space \(X\), one says that the convex inequality \(\phi(x)\leq0\) satisfies the basic constraint qualification (BCQ) at \(x\in S:=\left \{ u\in X:\phi(u)\leq0\right \} \) if \(N(S,x)=\left[ 0,+\infty \right) \partial \phi(x)\). Here, \(N(S,x)\) and \(\partial \phi(x)\) are, respectively, the normal cone of \(S\) at \(x\) and the subdifferential of \(\phi\) at \(x\), in the sense of convex analysis. The convex inequality is said to satisfy the strong BCQ at \(x\in \text{bd}(S)\) if there exists \(\tau>0\) such that \(N(S,x)\cap B_{X^{\ast}}\subset \left[ 0,\tau \right] \partial \phi(x)\), where \(B_{X^{\ast}}\) is the unit ball of the dual space \(X^{\ast}\). The aim of this paper is to define and study BCQ and strong BCQ when \(\phi\) is any proper, lower semicontinuous function. This is done by using either the Clarke normal cone and subdifferential (also the Clarke singular subdifferential if \(\phi\) is not locally Lipschitz), or the Fréchet normal cone and subdifferential. As an example, when \(\phi\) is locally Lipschitz, the inequality \(\phi(x)\leq0\) is said to satisfy the Clarke BCQ at \(x\) if \(N_{c}(S,x)\subset \left[ 0,+\infty \right) \partial_{c}\phi(x)\), where \(N_{c}(S,x)\) and and \(\partial_{c}\phi(x)\) are the Clarke normal cone and the Clarke subdifferential at \(x\). When \(\phi\) is convex and continuous, the new and the classical BCQ (respectively, strong BCQ) are equivalent.
- 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
- 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
- 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?)
- 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
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- On nonconvex version of the inequality of Clarke and Ledyaev
- On several types of basic constraint qualifications via coderivatives for generalized equations
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A Clarke-Ledyaev type inequality for certain non-convex sets
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- scientific article; zbMATH DE number 7347532 (Why is no real title available?)
- Nonsmooth constraint qualifications for nonconvex inequality systems
- scientific article; zbMATH DE number 6453520 (Why is no real title available?)
- scientific article; zbMATH DE number 6729884 (Why is no real title available?)
- Characterizations of the Strong Basic Constraint Qualifications
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- scientific article; zbMATH DE number 7733461 (Why is no real title available?)
- Fréchet BCQ and error bounds for a system of finitely many inequalities
- Lagrange-type optimization with inequality constraints
- On constraint qualifications in nonlinear programming
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)