The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories

DOI10.2307/2001397zbMATH Open0671.90046OpenAlexW4244652052MaRDI QIDQ3824099FDOQ3824099

Authors: Dave Bayer, Jeffrey C. Lagarias 

Publication date: 1989

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2001397

Recommendations

• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• scientific article; zbMATH DE number 4197743
• On the asymptotic behavior of the projective rescaling algorithm for linear programming
• scientific article; zbMATH DE number 4197739

zbMATH Keywords

vector fieldaffine scaling algorithmA-trajectoriescentral trajectoriesfeasible solution polytopeKarmarkar's projective scaling algorithmsLegendre transform coordinatesP-trajectoryPower-series expansions

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear ordinary differential equations and systems (34A34) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cited In (58)

• Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs
• The degree of the central curve in semidefinite, linear, and quadratic programming
• Deep Linear Networks for Matrix Completion—an Infinite Depth Limit
• Hessian barrier algorithms for non-convex conic optimization
• On the complexity of analyticity in semi-definite optimization
• Computing complex and real tropical curves using monodromy
• Completely integrable gradient systems on the manifolds of Gaussian and multinomial distributions
• Nonlinear coordinate representations of smooth optimization problems
• Differential-algebraic approach to linear programming
• Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
• Scaling, shifting and weighting in interior-point methods
• New trajectory-following polynomial-time algorithm for linear programming problems
• On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Long steps in an \(O(n^ 3L)\) algorithm for linear programming
• Image labeling by assignment
• Linear programming and the Newton barrier flow
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• A class of primal affine scaling algorithms
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• Degeneracy in interior point methods for linear programming: A survey
• Limiting behavior of weighted central paths in linear programming
• Gradient systems in view of information geometry
• Subgradient algorithm on Riemannian manifolds
• The central curve in linear programming
• A new vector field method for eigen-decomposition of symmetric matrices
• Computer geometry and encoding the information on a manifold
• Gradient systems associated with probability distributions
• Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
• A class of polynomial variable metric algorithms for linear optimization
• The dynamics and internal geometry of the three-city noxious location problem
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A primal-dual interior point method whose running time depends only on the constraint matrix
• K-K-T multiplier estimates and objective function lower bounds from projective SUMT
• Long-step strategies in interior-point primal-dual methods
• Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming
• Containing and shrinking ellipsoids in the path-following algorithm
• Algorithms for computing centroids
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
• Title not available (Why is that?)
• Continuous dynamical systems that realize discrete optimization on the hypercube
• The constrained Newton method on a Lie group and the symmetric eigenvalue problem
• A study of the dual affine scaling continuous trajectories for linear programming
• On the choice of parameters for power-series interior point algorithms in linear programming
• On the convergence of primal-dual interior-point methods with wide neighborhoods
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
• Improving the rate of convergence of interior point methods for linear programming
• On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
• A generalized homogeneous and self-dual algorithm for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Solving combinatorial optimization problems using Karmarkar's algorithm
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Optimizing over three-dimensional subspaces in an interior-point method for linear programming
• Affine-scaling for linear programs with free variables
• Improved complexity results on solving real-number linear feasibility problems
• Karmarkar's linear programming algorithm and Newton's method
• An interior point potential reduction method for constrained equations
• Identifying an optimal basis in linear programming

This page was built for publication: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories

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