A polynomial Newton method for linear programming
From MaRDI portal
Publication:1094330
DOI10.1007/BF01840456zbMath0629.90058OpenAlexW1980845317MaRDI QIDQ1094330
Guy de Ghellinck, Jean-Philippe Vial
Publication date: 1986
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840456
Related Items (44)
Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming ⋮ Interior-point algorithms for semi-infinite programming ⋮ Introduction: New approaches to linear programming ⋮ Exploiting special structure in Karmarkar's linear programming algorithm ⋮ Potential-reduction methods in mathematical programming ⋮ Long-step strategies in interior-point primal-dual methods ⋮ Solving nonlinear multicommodity flow problems by the analytic center cutting plane method ⋮ A generalized homogeneous and self-dual algorithm for linear programming ⋮ A combined phase I-phase II projective algorithm for linear programming ⋮ An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution ⋮ A path-following version of the Todd-Burrell procedure for linear programming ⋮ Cutting planes and column generation techniques with the projective algorithm ⋮ A cutting plane method from analytic centers for stochastic programming ⋮ An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex ⋮ A tree traversal algorithm for decision problems in knot theory and 3-manifold topology ⋮ An optimal-basis identification technique for interior-point linear programming algorithms ⋮ On lower bound updates in primal potential reduction methods for linear programming ⋮ A combined phase I-phase II scaled potential algorithm for linear programming ⋮ A survey of search directions in interior point methods for linear programming ⋮ A polynomial-time algorithm to decide liveness of bounded free choice nets ⋮ On Anstreicher's combined phase I-phase II projective algorithm for linear programming ⋮ A polynomial method of approximate centers for linear programming ⋮ On interior algorithms for linear programming with no regularity assumptions ⋮ A little theorem of the big \({\mathcal M}\) in interior point algorithms ⋮ A projective algorithm for linear programming with no regularity condition ⋮ Recurrent neural networks for linear programming: Analysis and design principles ⋮ On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm ⋮ On combined phase 1-phase 2 projective methods for linear programming ⋮ Search directions for a class of projective methods ⋮ Linear updates for a single-phase projective method ⋮ The steepest descent gravitational method for linear programming ⋮ Essentials of numerical nonsmooth optimization ⋮ On well definedness of the central path ⋮ Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs ⋮ Using an interior point method for the master problem in a decomposition approach ⋮ Essentials of numerical nonsmooth optimization ⋮ On monotonicity in the scaled potential algorithm for linear programming ⋮ On the symmetric affiine scaling algorithm for line programming* ⋮ An alternative derivation of the projective interior point method for linear programming through the least squares approach ⋮ The affine-scaling direction for linear programming is a limit of projective-scaling directions ⋮ Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming ⋮ On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP ⋮ An \(O(n^ 3L)\) potential reduction algorithm for linear programming ⋮ Updating lower bounds when using Karmarkar's projective algorithm for linear programming
Cites Work
This page was built for publication: A polynomial Newton method for linear programming
