Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
From MaRDI portal
Publication:2351521
DOI10.1007/s10898-014-0255-2zbMath1353.90174OpenAlexW2169519573MaRDI QIDQ2351521
Daishi Kuroiwa, Satoshi Suzuki
Publication date: 24 June 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0255-2
optimality conditionsefficient pointweakly efficient pointnonconvex vector optimizationlinearizing cone
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (14)
Characterizations of nonconvex optimization problems via variational inequalities ⋮ 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 ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem ⋮ On characterizations of solution sets of interval-valued quasiconvex programming problems ⋮ Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterization of radially lower semicontinuous pseudoconvex functions ⋮ Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
Cites Work
- 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 pseudoconvex functions and semistrictly quasiconvex ones
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
