Pages that link to "Item:Q4274639"
From MaRDI portal
The following pages link to A Short-Cut Potential Reduction Algorithm for Linear Programming (Q4274639):
Displaying 11 items.
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- Identifying an optimal basis in linear programming (Q1915926) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- (Q4792349) (← links)
- A truncated primal-infeasible dual-feasible network interior point method (Q4953319) (← links)
- A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)