Characterization of solution sets of quasiconvex programs

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)

zbMATH Keywords

solutions; optimality conditions; invexity; quasiconvex function; Generalized convexity; programming problem; sub-differentials

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C31: Sensitivity, stability, parametric optimization

Related Items

What is quasiconvex analysis?, Multipliers and general Lagrangians, Characterizations of optimal solution sets of convex infinite programs, Lagrangian approach to quasiconvex programing, Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• A simple characterization of solutions sets of convex programs
• On functions whose stationary points are global minima
• Lower subdifferentiability and integration
• Characterization of solution sets of convex programs
• Invexity and generalized convexity
• What is invexity?
• Semi-invex functions and their subdifferentials
• Various types of nonsmooth invex functions
• What is quasiconvex analysis?
• Nonsmooth invex functions and sufficient optimality conditions