Pages that link to "Item:Q1108927"
From MaRDI portal
The following pages link to A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927):
Displaying 50 items.
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← 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)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Deriving an unconstrained convex program for linear programming (Q1321279) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- A global Newton method. II: Analytic centers (Q1321647) (← 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)
- A new linesearch method for quadratically constrained convex programming (Q1342277) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- Volumetric path following algorithms for linear programming (Q1361113) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach (Q1433167) (← links)
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. (Q1569192) (← links)
- Interior-point methods (Q1593831) (← links)
- The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
- An interactive interior point algorithm for multiobjective linear programming problems (Q1604044) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- The Kantorovich theorem and interior point methods (Q1769068) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← 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)
- On well definedness of the central path (Q1807813) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- Polynomial affine algorithms for linear programming (Q1814590) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- An interior-point method for semi-infinite programming problems (Q1915915) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
