Pages that link to "Item:Q1174842"
From MaRDI portal
The following pages link to An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842):
Displaying 15 items.
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method (Q1610185) (← links)
- Identifying an optimal basis in linear programming (Q1915926) (← links)
- Basis- and partition identification for quadratic programming and linear complementarity problems (Q1961979) (← links)
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema (Q3835654) (← links)
- Stopping tests that compute optimal solutions for interior-point linear programming algorithms (Q3975042) (← links)
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods (Q4292667) (← links)
- (Q4298063) (← links)
- On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming (Q4427366) (← links)
- On the Identification of Zero Variables in an Interior-Point Framework (Q4509751) (← links)
- Using Indicators in Finite Termination Procedures (Q4810571) (← links)
- Enhancing the behavior of interior-point methods via identification of variables (Q5426974) (← links)
