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):
Displayed 50 items.
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← 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)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← 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)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- Pure adaptive search in global optimization (Q1184353) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- Modified barrier functions (theory and methods) (Q1186277) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems (Q1199751) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- 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)
