Pages that link to "Item:Q1814590"
From MaRDI portal
The following pages link to Polynomial affine algorithms for linear programming (Q1814590):
Displaying 25 items.
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← links)
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- Pure adaptive search in global optimization (Q1184353) (← links)
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- An interior point potential reduction algorithm for the linear complementarity problem (Q1196718) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- A class of polynomial variable metric algorithms for linear optimization (Q1814798) (← links)
- Nonlinear coordinate representations of smooth optimization problems (Q1905043) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)