Optimality Conditions for Quasiconvex Programs

DOI10.1137/040621843zbMath1165.90679OpenAlexW2089735459MaRDI QIDQ3440219

N. T. H. Linh, Jean-Paul Penot

Publication date: 22 May 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040621843

zbMATH Keywords

normal coneoptimality conditionsconvex programmingsubdifferentialquasiconvex functionquasiconvex programmingGutteriez functionPlastria function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (19)

Characterizations of nonconvex optimization problems via variational inequalities ⋮ Portfolio Optimization with Quasiconvex Risk Measures ⋮ Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry ⋮ Optimality conditions for convex problems on intersections of non necessarily convex sets ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Generalized affine functions and generalized differentials ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ On global subdifferentials with applications in nonsmooth optimization ⋮ A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant ⋮ Generalized convex functions and generalized differentials ⋮ Projective dualities for quasiconvex problems ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential

This page was built for publication: Optimality Conditions for Quasiconvex Programs