Pages that link to "Item:Q1101008"
From MaRDI portal
The following pages link to A multiplicative barrier function method for linear programming (Q1101008):
Displaying 27 items.
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- A convexity theorem for multiplicative functions (Q691470) (← links)
- Two design principles of geometric algorithms in finite-precision arithmetic (Q749243) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- On the convexity of the multiplicative version of Karmarkar's potential function (Q1111466) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← links)
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- Integrability of vector and multivector fields associated with interior point methods for linear programming (Q1181913) (← links)
- Generalized convexity on affine subspaces with an application to potential functions (Q1199752) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
- A class of polynomial variable metric algorithms for linear optimization (Q1814798) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems (Q1904697) (← links)
- Nonlinear coordinate representations of smooth optimization problems (Q1905043) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- Value estimation approach to the Iri-Imai method for constrained convex optimization (Q2569197) (← links)
- Search directions for interior linear-programming methods (Q2639771) (← links)
