Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming
From MaRDI portal
Publication:1325127
DOI10.1007/BF03167209zbMath0799.90088MaRDI QIDQ1325127
Publication date: 24 May 1994
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Toda latticegradient systemLax pairnonlinear dynamical systemKarmarkar's projective scaling algorithm
Related Items (4)
On explicit solvable gradient systems of Moser-Karmarkar type ⋮ Jacobi algorithm for symmetric eigenvalue problem and integrable gradient system of Lax form ⋮ Koszul information geometry, Liouville-Mineur integrable systems and Moser isospectral deformation method for Hermitian positive-definite matrices ⋮ Neurodynamics and nonlinear integrable systems of Lax type
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Hamiltonian structure of dynamical systems which solve linear programming problems
- Integrability of vector and multivector fields associated with interior point methods for linear programming
- A new nonlinear dynamical system that leads to eigenvalues
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- 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
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Finitely many mass points on the line under the influence of an exponential potential -- an integrable system
This page was built for publication: Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming
