Pages that link to "Item:Q4018391"
From MaRDI portal
The following pages link to A Low Complexity Interior-Point Algorithm for Linear Programming (Q4018391):
Displaying 14 items.
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
- A modified layered-step interior-point algorithm for linear programming (Q1290624) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- An accelerated interior point method whose running time depends only on \(A\) (extended abstract) (Q2817643) (← links)
- (Q4288560) (← links)
- A circular cone relaxation primal interior point algorithm for LP (Q4467177) (← links)
