Pages that link to "Item:Q1177228"
From MaRDI portal
The following pages link to Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228):
Displaying 32 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← 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)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← 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)
- A polynomial method of approximate centers for linear programming (Q1196720) (← 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 \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← 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)
- 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)
- 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)
- 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)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
