The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
From MaRDI portal
Publication:3478261
DOI10.2307/2001758zbMath0699.90070OpenAlexW4231749296MaRDI QIDQ3478261
Publication date: 1990
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2001758
Convex programming (90C25) Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Nonlinear ordinary differential equations and systems (34A34) Distance geometry (51K99) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Related Items
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem, Gradient systems in view of information geometry, A primal-dual interior point method whose running time depends only on the constraint matrix, New trajectory-following polynomial-time algorithm for linear programming problems, Identifying an optimal basis in linear programming, Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory, Karmarkar's linear programming algorithm and Newton's method, Improving the rate of convergence of interior point methods for linear programming, A new vector field method for eigen-decomposition of symmetric matrices, On the choice of parameters for power-series interior point algorithms in linear programming, On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming, Gradient systems associated with probability distributions
