Pages that link to "Item:Q1090251"
From MaRDI portal
The following pages link to A note on a quadratic formulation for linear complementarity problems (Q1090251):
Displaying 11 items.
- A note on reduction of quadratic and bilinear programs with equality constraints (Q598586) (← links)
- Active constraints, indefinite quadratic test problems, and complexity (Q911993) (← links)
- A dual exact penalty formulation for the linear complementarity problem (Q1093553) (← links)
- An LP-based successive overrelaxation method for linear complementarity problems (Q1093555) (← links)
- A note on composite concave quadratic programming (Q1306393) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- A method of complementary basis for quadratic programming (Q1803157) (← links)
- Subspace accelerated matrix splitting algorithms for asymmetric and symmetric linear complementarity problems (Q2866190) (← links)
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems (Q3200891) (← links)
- (Q5750734) (← links)
- On reduced convex QP formulations of monotone LCPs (Q5943077) (← links)