Duality for anticonvex programs.

DOI10.1023/A:1008327614099zbMath1033.90149OpenAlexW102495498MaRDI QIDQ5929391

Jean-Paul Penot

Publication date: 18 February 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008327614099

zbMATH Keywords

dualitynonconvex dualitypolar setquasiconvex functionradiant setreverse convex programShady set

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53) Convexity of real functions of several variables, generalizations (26B25)

Related Items (10)

Reverse convex problems: an approach based on optimality conditions ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ The directional subdifferential of the difference of two convex functions ⋮ Critical duality ⋮ Are dualities appropriate for duality theories in optimization? ⋮ What is quasiconvex analysis? ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ Representation of generalized monotone multimaps ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints

This page was built for publication: Duality for anticonvex programs.