Pages that link to "Item:Q1749452"
From MaRDI portal
The following pages link to A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452):
Displaying 9 items.
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs (Q2005902) (← links)
- Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method (Q2105287) (← links)
- The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Strategic investment decisions in an oligopoly with a competitive fringe: an equilibrium problem with equilibrium constraints approach (Q6106796) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)