Pages that link to "Item:Q409266"
From MaRDI portal
The following pages link to On solving linear complementarity problems by DC programming and DCA (Q409266):
Displaying 14 items.
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- A new concave minimization algorithm for the absolute value equation solution (Q2047210) (← links)
- A class of semi-supervised support vector machines by DC programming (Q2256780) (← links)
- A sub-additive DC approach to the complementarity problem (Q2419555) (← links)
- Optimization based DC programming and DCA for hierarchical clustering (Q2643938) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
