Pages that link to "Item:Q3346107"
From MaRDI portal
The following pages link to Solving the linear complementarity problem through concave programming (Q3346107):
Displaying 9 items.
- Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← links)
- Solving linear optimization problems with max-star composition equation constraints (Q849775) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
- A new concave minimization algorithm for the absolute value equation solution (Q2047210) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- An experimental study of a DC optimization algorithm for bimatrix games (Q5164671) (← links)
- (Q5389783) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)