Duality in Reverse Convex Optimization
From MaRDI portal
Publication:4229461
Recommendations
Cited in
(17)- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Duality in D. C. programming: The case of several D. C. constraints
- Lagrange duality in canonical DC programming
- Duality and optimality conditions for reverse convex programs via a convex decomposition
- Some further duality theorems for optimization problems with reverse convex constraint sets
- scientific article; zbMATH DE number 3307156 (Why is no real title available?)
- A note on duality in reverse convex optimization
- Distance functions in some class of infinite dimensional vector spaces
- Technical efficiency and distance to a reverse convex set
- Meaned spaces and a general duality principle
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
- Lagrangian duality theorems for reverse convex infimization
- 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
- Some new Farkas-type results for inequality systems with DC functions
- Non-Convex feasibility problems and proximal point methods
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)