Pages that link to "Item:Q1181912"
From MaRDI portal
The following pages link to A survey of search directions in interior point methods for linear programming (Q1181912):
Displayed 16 items.
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- An extended variant of Karmarkar's interior point algorithm (Q879548) (← links)
- Integrability of vector and multivector fields associated with interior point methods for linear programming (Q1181913) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Prior reduced fill-in in solving equations in interior point algorithms (Q1197902) (← links)
- A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- Piecewise linear programming via interior points (Q1582686) (← links)
- A class of polynomial variable metric algorithms for linear optimization (Q1814798) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- An alternative derivation of the projective interior point method for linear programming through the least squares approach (Q4764596) (← links)
