Characterizations of the solution set for non-essentially quasiconvex programming
From MaRDI portal
Publication:1686559
DOI10.1007/s11590-016-1084-7zbMath1454.90065OpenAlexW2522923325MaRDI QIDQ1686559
Daishi Kuroiwa, Satoshi Suzuki
Publication date: 15 December 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1084-7
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15)
Related Items (6)
Characterizations of the solution set for tangentially convex optimization problems ⋮ Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Subdifferential calculus for a quasiconvex function with generator
- Lower subdifferentiable functions and their minimization by cutting planes
- Characterizations of the solution sets of convex programs and variational inequality problems
- On characterizing the solution sets of pseudoinvex extremum problems
- A simple characterization of solutions sets of convex programs
- Generalized concavity
- Characterization of solution sets of quasiconvex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Some constraint qualifications for quasiconvex vector-valued systems
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Strong and total Lagrange dualities for quasiconvex programming
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterizations of pseudoconvex functions and semistrictly quasiconvex ones
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Inexact subgradient methods for quasi-convex optimization problems
- Characterization of solution sets of convex programs
- An Appropriate Subdifferential for Quasiconvex Functions
- Optimality Conditions for Quasiconvex Programs
- Quasiconvex duality theory by generalized conjugation methods
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- What is quasiconvex analysis?
- On Quasi-Convex Duality
This page was built for publication: Characterizations of the solution set for non-essentially quasiconvex programming
