Outer approximation algorithms for DC programs and beyond
From MaRDI portal
Recommendations
- Outer approximation algorithms for canonical DC problems
- Canonical DC programming problem: Outer approximation methods revisited
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
- An algorithm for solving general D. C. programming problems
- Beyond canonical dc-optimization: the single reverse polar problem
Cites work
- A modified version of Tuy's method for solving d.c. programing problem
- A quasiconcave minimization method for solving linear two-level programs
- Approximate optimality conditions and stopping criteria in canonical DC programming
- Convex programs with an additional reverse convex constraint
- scientific article; zbMATH DE number 757676 (Why is no real title available?)
- Outer approximation algorithms for canonical DC problems
Cited in
(5)- Convergent outer approximation algorithms for solving unary programs
- Canonical DC programming problem: Outer approximation methods revisited
- A new necessary and sufficient global optimality condition for canonical DC problems
- Outer approximation algorithms for canonical DC problems
- scientific article; zbMATH DE number 6921290 (Why is no real title available?)
This page was built for publication: Outer approximation algorithms for DC programs and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607880)
