Optimality conditions and the basic constraint qualification for quasiconvex programming
DOI10.1016/J.NA.2010.09.066zbMATH Open1236.90142OpenAlexW2029127661MaRDI QIDQ622397FDOQ622397
Authors: 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
Recommendations
- Optimality conditions and constraint qualifications for quasiconvex programming
- $\alpha $-Lower Subdifferentiable Functions
- scientific article; zbMATH DE number 1328981
- Strong and total Lagrange dualities for quasiconvex programming
- Local maximum points of explicitly quasiconvex functions
- On a theorem due to Crouzeix and Ferland
- Quasiconvex minimization on a locally finite union of convex sets
- Abstract cone approximations and generalized differentiability in nonsmooth optimization
- Generators and constraint qualifications for quasiconvex inequality systems
- Strict lower subdifferentiability and applications
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- On Quasi-Convex Duality
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- On set containment characterization and constraint qualification for quasiconvex programming
Cited In (33)
- Quasi-convex functions and applications to optimality conditions in nonlinear programming
- Title not available (Why is that?)
- Sandwich theorem for quasiconvex functions and its applications
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- Necessary and sufficient constraint qualification for surrogate duality
- Subdifferential calculus for a quasiconvex function with generator
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- A sharp Lagrange multiplier theorem for nonlinear programs
- Duality theorems for separable convex programming without qualifications
- Characterizations of the solution set for tangentially convex optimization problems
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Nonlinear error bounds for quasiconvex inequality systems
- Minimizing the difference of two quasiconvex functions
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- Some constraint qualifications for quasiconvex vector-valued systems
- Duality theorems for convex and quasiconvex set functions
- Nonlinear programming via König's maximum theorem
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Optimality Conditions for Quasiconvex Programs
- Characterizations of the solution set for non-essentially quasiconvex programming
- Strong and total Lagrange dualities for quasiconvex programming
- Title not available (Why is that?)
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions and constraint qualifications for quasiconvex programming
- Title not available (Why is that?)
- Quasiconvex programming with locally starshaped constraint region and applications to quasiconvex MPEC
- On sufficient optimality conditions for a quasiconvex programming problem
- Strong and total Lagrange dualities for quasiconvex programming
This page was built for publication: Optimality conditions and the basic constraint qualification for quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622397)