Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
From MaRDI portal
Publication:1681319
DOI10.1016/j.ejor.2017.07.038zbMath1374.90354OpenAlexW2739018374MaRDI QIDQ1681319
Vaithilingam Jeyakumar, Hossein Mohebi, Guoyin Li, Nguyen Huy Chieu
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.038
convex programmingnecessary and sufficient optimality conditionsbest approximationconstraint qualificationsnonconvex constraints
Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems ⋮ New qualification conditions for convex optimization without convex representation ⋮ Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Unnamed Item ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems ⋮ Subdifferential of the supremum via compactification of the index set ⋮ Optimality conditions for nonconvex problems over nearly convex feasible sets ⋮ Unnamed Item ⋮ Optimality Conditions for Nonconvex Constrained Optimization Problems ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications in convex vector semi-infinite optimization
- On convex optimization without convex representation
- On representations of the feasible set in convex optimization
- Generalizations of Slater's constraint qualification for infinite convex programs
- Fenchel duality and the strong conical hull intersection property
- Optimality conditions in convex optimization revisited
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- The strong conical hull intersection property for convex programming
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
- Convex Bodies The Brunn-MinkowskiTheory
- A Global Approach to Nonlinearly Constrained Best Approximation
