Characterization of solution sets of quasiconvex programs

From MaRDI portal
Publication:1411529

DOI10.1023/A:1023905907248zbMath1043.90071MaRDI QIDQ1411529

Jean-Paul Penot

Publication date: 29 October 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)




Related Items (35)

Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problemsPortfolio Optimization with Quasiconvex Risk MeasuresMultipliers and general LagrangiansOptimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalitiesCharacterizations of robust solution set of convex programs with uncertain dataA new approach to characterize the solution set of a pseudoconvex programming problemCharacterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimizationSlater CQ, optimality and duality for quasiconvex semi-infinite optimization problemsCharacterizations of the solution set for tangentially convex optimization problemsCharacterizations of the solution set for non-essentially quasiconvex programmingCharacterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentialsCharacterizations of solution sets of differentiable quasiconvex programming problemsGeneralized affine functions and generalized differentialsSemistrictly and neatly quasiconvex programming using lower global subdifferentialsOptimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentialsOn characterizations of solution sets of interval-valued quasiconvex programming problemsCharacterizations of the solution set for a class of nonsmooth optimization problemsLagrangian approach to quasiconvex programingUnnamed ItemUnnamed ItemA note on characterization of solution sets to pseudolinear programming problemsLagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problemsInterior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraintsCharacterizing robust solution sets of convex programs under data uncertaintyKarush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferentialOptimality conditions and constraint qualifications for quasiconvex programmingWhat is quasiconvex analysis?Characterizations of optimal solution sets of convex infinite programsCharacterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential SubdifferentialsDual approaches to characterize robust optimal solution sets for a class of uncertain optimization problemsAlgorithms for quasiconvex minimizationPareto optimal allocations and optimal risk sharing for quasiconvex risk measuresGeneralized convex functions and generalized differentialsProjective dualities for quasiconvex problemsCharacterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential



Cites Work


This page was built for publication: Characterization of solution sets of quasiconvex programs