Duality in Reverse Convex Optimization

DOI10.1137/S1052623495295857zbMath0914.90263MaRDI QIDQ4229461

No author found.

Publication date: 22 February 1999

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

zbMATH Keywords

dualityD.C. optimizationreverse convex constraintreverse convexextended real-valued convex function

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Related Items (11)

Duality for multiobjective optimization problems with convex objective functions and D.C. constraints ⋮ Lagrangian duality theorems for reverse convex infimization ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Lagrange duality in canonical DC programming ⋮ Duality principles for optimization problems dealing with the difference of vector-valued convex mappings ⋮ Non-Convex feasibility problems and proximal point methods ⋮ Technical efficiency and distance to a reverse convex set ⋮ Duality in D. C. programming: The case of several D. C. constraints ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints

This page was built for publication: Duality in Reverse Convex Optimization