Pages that link to "Item:Q3813618"
From MaRDI portal
The following pages link to A modified version of Tuy's method for solving d.c. programing problem (Q3813618):
Displaying 13 items.
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- Outer approximation algorithms for DC programs and beyond (Q607880) (← links)
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
- Computing a global optimal solution to a design centering problem (Q1184340) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
- Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
