Pages that link to "Item:Q4504786"
From MaRDI portal
The following pages link to User'S guide To Lipsol linear-programming interior point solvers V0.4 (Q4504786):
Displaying 10 items.
- A self-adjusting interior point algorithm for linear complementarity problems (Q814067) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- Robust preliminary analysis of large-scale linear model for optimal industrial investments (Q2271503) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction (Q2511088) (← links)
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
