Pages that link to "Item:Q1919172"
From MaRDI portal
The following pages link to Canonical DC programming problem: Outer approximation methods revisited (Q1919172):
Displaying 17 items.
- Outer approximation algorithms for DC programs and beyond (Q607880) (← links)
- On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
- Reverse convex problems: an approach based on optimality conditions (Q868408) (← links)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- On modeling and global solutions for d.c. optimization problems by canonical duality theory (Q1734755) (← links)
- Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
- Beyond canonical dc-optimization: the single reverse polar problem (Q1935286) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- DC programming: overview. (Q1969457) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- An alogrithm for monotonic global optimization problems<sup>∗</sup> (Q2720273) (← links)
- (Q3004785) (← links)
- Approximate optimality conditions and stopping criteria in canonical DC programming (Q3562379) (← links)
- (Q4581828) (← links)
- Successive search methods for solving a canonical DC programming problem (Q5413891) (← links)