The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
From MaRDI portal
Publication:3824099
DOI10.2307/2001397zbMath0671.90046MaRDI QIDQ3824099
Jeffrey C. Lagarias, David Bayer
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
vector field; affine scaling algorithm; A-trajectories; central trajectories; feasible solution polytope; Karmarkar's projective scaling algorithms; Legendre transform coordinates; P-trajectory; Power-series expansions
90C05: Linear programming
34A34: Nonlinear ordinary differential equations and systems
52A40: Inequalities and extremum problems involving convexity in convex geometry
Related Items
Completely integrable gradient systems on the manifolds of Gaussian and multinomial distributions, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory, Linear programming and the Newton barrier flow, New trajectory-following polynomial-time algorithm for linear programming problems, Karmarkar's linear programming algorithm and Newton's method, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function, Improving the rate of convergence of interior point methods for linear programming, Solving combinatorial optimization problems using Karmarkar's algorithm, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, Algorithms for computing centroids, Subgradient algorithm on Riemannian manifolds, The dynamics and internal geometry of the three-city noxious location problem, Degeneracy in interior point methods for linear programming: A survey, K-K-T multiplier estimates and objective function lower bounds from projective SUMT, Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming, Gradient systems associated with probability distributions, Limiting behavior of weighted central paths in linear programming, Scaling, shifting and weighting in interior-point methods, Gradient systems in view of information geometry, A primal-dual interior point method whose running time depends only on the constraint matrix, Long-step strategies in interior-point primal-dual methods, Improved complexity using higher-order correctors for primal-dual Dikin affine scaling, Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space, 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, Affine-scaling for linear programs with free variables, Containing and shrinking ellipsoids in the path-following algorithm, An interior point potential reduction method for constrained equations, A class of polynomial variable metric algorithms for linear optimization, Differential-algebraic approach to linear programming, A generalized homogeneous and self-dual algorithm for linear programming, Nonlinear coordinate representations of smooth optimization problems, Identifying an optimal basis in linear programming, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, A new vector field method for eigen-decomposition of symmetric matrices, Improved complexity results on solving real-number linear feasibility problems, Continuous dynamical systems that realize discrete optimization on the hypercube, The constrained Newton method on a Lie group and the symmetric eigenvalue problem, Limiting behavior of the affine scaling continuous trajectories for linear programming problems
