Surrogate Programming and Multipliers in Quasi-convex Programming

DOI10.1137/S0363012902327819zbMath1134.49315OpenAlexW1967551841MaRDI QIDQ4652507

Jean-Paul Penot, Michel Volle

Publication date: 28 February 2005

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

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

zbMATH Keywords

multipliersLagrangianquasi-convex functionsqualification conditionseven convexitysurrogate programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)

Related Items

Multipliers and general Lagrangians ⋮ Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ Level sets regularization with application to optimization problems ⋮ Lagrangian approach to quasiconvex programing ⋮ Critical duality ⋮ Are dualities appropriate for duality theories in optimization? ⋮ Generalized convex functions and generalized differentials ⋮ Projective dualities for quasiconvex problems ⋮ Surrogate duality for robust optimization ⋮ On generalized surrogate duality in mixed-integer nonlinear programming

This page was built for publication: Surrogate Programming and Multipliers in Quasi-convex Programming