Pages that link to "Item:Q912758"
From MaRDI portal
The following pages link to A ``build-down'' scheme for linear programming (Q912758):
Displaying 9 items.
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
