On constraint qualifications of a nonconvex inequality
From MaRDI portal
Publication:723504
DOI10.1007/s11590-017-1172-3zbMath1407.90343arXiv1703.03966MaRDI QIDQ723504
Publication date: 31 July 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.03966
90C26: Nonconvex programming, global optimization
49J52: Nonsmooth analysis
90C48: Programming in abstract spaces
Related Items
Unnamed Item, On several types of basic constraint qualifications via coderivatives for generalized equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Local and global optimality conditions for dc infinite optimization problems
- On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On metric subregularity for convex constraint systems by primal equivalent conditions
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Regularities and their relations to error bounds
- Strong Abadie CQ, ACQ, calmness and linear regularity
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Metric Subregularity and Constraint Qualifications for Convex Generalized Equations in Banach Spaces
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Variational Analysis
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Characterizations of the Strong Basic Constraint Qualifications
- Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
- New Farkas-type constraint qualifications in convex infinite programming
- Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces
