Solving the linear complementarity problem through concave programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3856836
- Linear complementarity problems solvable as linear programs
- On linear programs with linear complementarity constraints
- The problem of convex programming with linear constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- Linear complementarity problems solvable by integer programming
- On the convex programming approach to linear programming
- scientific article; zbMATH DE number 6027005
- scientific article; zbMATH DE number 4135708
- Convexification techniques for linear complementarity constraints
Cited in
(9)- On solving difference of convex functions programs with linear complementarity constraints
- A new concave minimization algorithm for the absolute value equation solution
- Global minimization of indefinite quadratic problems
- An experimental study of a DC optimization algorithm for bimatrix games
- The Linear Complementarity Problems with a Few Variables per Constraint
- Solving linear optimization problems with max-star composition equation constraints
- Note on solving linear complementarity problems as jointly constrained bilinear programs
- scientific article; zbMATH DE number 6027005 (Why is no real title available?)
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
This page was built for publication: Solving the linear complementarity problem through concave programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346107)
