A polynomial Newton method for linear programming

Recommendations

A polynomial-time algorithm, based on Newton's method, for linear programming
Polynomial affine algorithms for linear programming
Karmarkar's linear programming algorithm and Newton's method
A new polynomial-time algorithm for linear programming
An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations

Cites work

scientific article; zbMATH DE number 3121281 (Why is no real title available?)
A new polynomial-time algorithm for linear programming
An extension of Karmarkar's algorithm for linear programming using dual variables
An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
Khachiyan's linear programming algorithm

Cited in

(49)

An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
scientific article; zbMATH DE number 4181135 (Why is no real title available?)
On the symmetric affiine scaling algorithm for line programming^*
Long-step strategies in interior-point primal-dual methods
An alternative derivation of the projective interior point method for linear programming through the least squares approach
Linear updates for a single-phase projective method
Search directions for a class of projective methods
A combined phase I-phase II projective algorithm for linear programming
The steepest descent gravitational method for linear programming
A polynomial-time algorithm to decide liveness of bounded free choice nets
A generalized homogeneous and self-dual algorithm for linear programming
scientific article; zbMATH DE number 4141790 (Why is no real title available?)
An \(O(n^ 3L)\) potential reduction algorithm for linear programming
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
scientific article; zbMATH DE number 4110452 (Why is no real title available?)
A combined phase I-phase II scaled potential algorithm for linear programming
Updating lower bounds when using Karmarkar's projective algorithm for linear programming
On interior algorithms for linear programming with no regularity assumptions
A projective algorithm for linear programming with no regularity condition
Recurrent neural networks for linear programming: Analysis and design principles
On combined phase 1-phase 2 projective methods for linear programming
scientific article; zbMATH DE number 5991677 (Why is no real title available?)
On lower bound updates in primal potential reduction methods for linear programming
Exploiting special structure in Karmarkar's linear programming algorithm
scientific article; zbMATH DE number 4119927 (Why is no real title available?)
Cutting planes and column generation techniques with the projective algorithm
Introduction: New approaches to linear programming
A little theorem of the big \({\mathcal M}\) in interior point algorithms
Using an interior point method for the master problem in a decomposition approach
Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
On monotonicity in the scaled potential algorithm for linear programming
The affine-scaling direction for linear programming is a limit of projective-scaling directions
Essentials of numerical nonsmooth optimization
A survey of search directions in interior point methods for linear programming
A path-following version of the Todd-Burrell procedure for linear programming
An optimal-basis identification technique for interior-point linear programming algorithms
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
Potential-reduction methods in mathematical programming
Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
On well definedness of the central path
A cutting plane method from analytic centers for stochastic programming
Essentials of numerical nonsmooth optimization
Newton-type method for solving systems of linear equations and inequalities
Interior-point algorithms for semi-infinite programming
A polynomial method of approximate centers for linear programming

This page was built for publication: A polynomial Newton method for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094330)