An algorithm for linear programming which requires O(((m+n)n^ 2+(m+n)^1.5n)L) arithmetic operations
From MaRDI portal
Publication:920841
Recommendations
- scientific article; zbMATH DE number 4131946
- Linear Programming in O([n3/ln n]L) Operations
- An O(n log n)-algorithm for solving a special class of linear programs
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- scientific article; zbMATH DE number 19340
- Linear time algorithms for linear programming
- scientific article; zbMATH DE number 1131729
- An efficient algorithm for linear programming
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3528040 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Systems of distinct representatives and linear algebra
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
Cited in
(72)- Smoothed analysis of condition numbers and complexity implications for linear programming
- Interior-point algorithms for semi-infinite programming
- New approximability results for two-dimensional bin packing
- scientific article; zbMATH DE number 4185392 (Why is no real title available?)
- Locating tree-shaped facilities using the ordered median objective
- Probing through the intersection of hyperplanes
- Extensions of the potential reduction algorithm for linear programming
- Polynomial affine algorithms for linear programming
- On the finite convergence of interior-point algorithms for linear programming
- A polynomial method of approximate centers for linear programming
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
- Interior-point methods: An old and new approach to nonlinear programming
- Fair Policy Targeting
- Tensors in computations
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- Linear programming and the Newton barrier flow
- A cutting plane algorithm for convex programming that uses analytic centers
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Convergence behavior of interior-point algorithms
- An exterior-point method for linear programming problems
- Men and progress in linear programming
- An interactive interior point algorithm for multiobjective linear programming problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A projection cutting plane algorithm for convex programming problems
- A direct heuristic algorithm for linear programming
- Finding an interior point in the optimal face of linear programs
- A scaling technique for finding the weighted analytic center of a polytope
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Enumerating a subset of the integer points inside a Minkowski sum
- Solving linear programming problems exactly
- Approximation algorithms for inventory problems with submodular or routing costs
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- A polynomial Newton method for linear programming
- A globally convergent primal-dual interior point algorithm for convex programming
- A note on the subtree ordered median problem in networks based on nestedness property
- scientific article; zbMATH DE number 1471763 (Why is no real title available?)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- scientific article; zbMATH DE number 169279 (Why is no real title available?)
- Long-step strategies in interior-point primal-dual methods
- Interior path following primal-dual algorithms. I: Linear programming
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models
- Containing and shrinking ellipsoids in the path-following algorithm
- Interior-point algorithm for quadratically constrained entropy minimization problems
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- A simple complexity proof for a polynomial-time linear programming algorithm
- The complexity of a special convex programming problem connected with nonlinear optimization
- A new polynomial-time algorithm for linear programming
- A survey of search directions in interior point methods for linear programming
- On linear programming and matrix scaling over the algebraic numbers
- On the convergence of the affine-scaling algorithm
- A combinatorial interior point method for network flow problems
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- scientific article; zbMATH DE number 4121752 (Why is no real title available?)
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- scientific article; zbMATH DE number 4062817 (Why is no real title available?)
- An extension of predictor-corrector algorithm to a class of convex separable program
- scientific article; zbMATH DE number 4131946 (Why is no real title available?)
- A new potential reduction algorithm for smooth convex programming
- Maximum flow and minimum-cost flow in almost-linear time
This page was built for publication: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920841)
