Duality in Reverse Convex Optimization
From MaRDI portal
Publication:4229461
DOI10.1137/S1052623495295857zbMath0914.90263MaRDI QIDQ4229461
No author found.
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
duality; D.C. optimization; reverse convex constraint; reverse convex; extended real-valued convex function
90C25: Convex programming
90C26: Nonconvex programming, global optimization
90C48: Programming in abstract spaces
49N15: Duality theory (optimization)
Related Items
Lagrangian duality theorems for reverse convex infimization, Non-Convex feasibility problems and proximal point methods, Duality principles for optimization problems dealing with the difference of vector-valued convex mappings, Optimality conditions for D.C. vector optimization problems under reverse convex constraints, Duality for multiobjective optimization problems with convex objective functions and D.C. constraints, Some new Farkas-type results for inequality systems with DC functions, Duality in D. C. programming: The case of several D. C. constraints, Technical efficiency and distance to a reverse convex set