Optimality conditions and the basic constraint qualification for quasiconvex programming
From MaRDI portal
Publication:622397
DOI10.1016/j.na.2010.09.066zbMath1236.90142OpenAlexW2029127661MaRDI QIDQ622397
Satoshi Suzuki, Daishi Kuroiwa
Publication date: 31 January 2011
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.2010.09.066
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (23)
Duality theorems for separable convex programming without qualifications ⋮ Nonlinear error bounds for quasiconvex inequality systems ⋮ A sharp Lagrange multiplier theorem for nonlinear programs ⋮ Nonlinear programming via König's maximum theorem ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system ⋮ Some constraint qualifications for quasiconvex vector-valued systems ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Minimizing the difference of two quasiconvex functions ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Sandwich theorem for quasiconvex functions and its applications ⋮ Revisiting the Hahn-Banach theorem and nonlinear infinite programming ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Subdifferential calculus for a quasiconvex function with generator ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Cites Work
- On set containment characterization and constraint qualification for quasiconvex programming
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On Quasi-Convex Duality
This page was built for publication: Optimality conditions and the basic constraint qualification for quasiconvex programming
