Pages that link to "Item:Q811360"
From MaRDI portal
The following pages link to An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360):
Displaying 50 items.
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← 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)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← 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)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← 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)
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← 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)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
