Subdifferential calculus for a quasiconvex function with generator
DOI10.1016/J.JMAA.2011.06.015zbMATH Open1222.49023OpenAlexW2043483408MaRDI QIDQ719604FDOQ719604
Authors: Satoshi Suzuki, Daishi Kuroiwa 
Publication date: 10 October 2011
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.06.015
Recommendations
- An appropriate subdifferential for quasiconvex functions
- Minimizing the difference of two quasiconvex functions
- Elements of quasiconvex subdifferential calculus
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Optimality conditions and constraint qualifications for quasiconvex programming
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)
Cites Work
- Title not available (Why is that?)
- Quasiconvex duality theory by generalized conjugation methods
- Title not available (Why is that?)
- On Quasi-Convex Duality
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- A note on epsilon-subgradients and maximal monotonicity
- On set containment characterization and constraint qualification for quasiconvex programming
- Title not available (Why is that?)
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- Characterisations of quasiconvex functions
- Mean value theorems and sufficient optimality conditions for nonsmooth functions
- Mean-value theorem with small subdifferentials
- Mean Value Inequalities
Cited In (10)
- Calculating the proximal subdifferential via the quasidifferential
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality theorems for separable convex programming without qualifications
- Characterizations of the solution set for tangentially convex optimization problems
- Elements of quasiconvex subdifferential calculus
- Characterizations of the solution set for non-essentially quasiconvex programming
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions and constraint qualifications for quasiconvex programming
This page was built for publication: Subdifferential calculus for a quasiconvex function with generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719604)
