Duality in Reverse Convex Optimization
From MaRDI portal
Publication:4229461
DOI10.1137/S1052623495295857zbMATH Open0914.90263MaRDI QIDQ4229461FDOQ4229461
Authors:
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Cited In (17)
- Lagrange duality in canonical DC programming
- Duality and optimality conditions for reverse convex programs via a convex decomposition
- Title not available (Why is that?)
- Meaned spaces and a general duality principle
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Technical efficiency and distance to a reverse convex set
- Some new Farkas-type results for inequality systems with DC functions
- Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Duality in D. C. programming: The case of several D. C. constraints
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Non-Convex feasibility problems and proximal point methods
- Some further duality theorems for optimization problems with reverse convex constraint sets
- A note on duality in reverse convex optimization
- Lagrangian duality theorems for reverse convex infimization
- Distance functions in some class of infinite dimensional vector spaces
This page was built for publication: Duality in Reverse Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229461)
