On a local search for reverse convex problems
From MaRDI portal
Recommendations
- Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
- On the use of cuts in reverse convex programs
- On convergence of a global search strategy for reverse convex problems
- Reverse convex problems: an approach based on optimality conditions
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
Cited in
(5)- Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
- New global optimality conditions for nonsmooth DC optimization problems
- Computational experience using an edge search algorithm for linear reverse convex programs
- Local search in problems with nonconvex constraints
- On convergence of a global search strategy for reverse convex problems
This page was built for publication: On a local search for reverse convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492520)
