Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming

DOI10.1016/j.na.2011.11.025zbMath1267.90099OpenAlexW2068436216MaRDI QIDQ412765

Daishi Kuroiwa, Satoshi Suzuki

Publication date: 4 May 2012

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2011.11.025

zbMATH Keywords

constraint qualificationquasiconvex programming

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (10)

Duality theorems for separable convex programming without qualifications ⋮ Nonlinear error bounds for quasiconvex inequality systems ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Lagrange duality in canonical DC programming ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential

Cites Work

• Optimality conditions and the basic constraint qualification for quasiconvex programming
• On set containment characterization and constraint qualification for quasiconvex programming
• New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
• About differentiability of order one of quasiconvex functions on \(R^ n\).
• Continuity properties of the normal cone to the level sets of a quasiconvex function
• On strong and total Lagrange duality for convex optimization problems
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• An alternative formulation for a new closed cone constraint qualification
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• On Quasi-Convex Duality

This page was built for publication: Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming