Hamiltonian structure of dynamical systems which solve linear programming problems

DOI10.1016/0167-2789(91)90062-EzbMath0745.58023OpenAlexW2111965642MaRDI QIDQ1181368

Leonid Faybusovich

Publication date: 27 June 1992

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-2789(91)90062-e

zbMATH Keywords

linear programming problemscompletely integrable Hamiltonian systems

Mathematics Subject Classification ID

Linear programming (90C05) Completely integrable infinite-dimensional Hamiltonian and Lagrangian systems, integration methods, integrability tests, integrable hierarchies (KdV, KP, Toda, etc.) (37K10) Completely integrable finite-dimensional Hamiltonian systems, integration methods, integrability tests (37J35)

Related Items (12)

On explicit solvable gradient systems of Moser-Karmarkar type ⋮ Random matrix theory for the analysis of the performance of an analog computer: a scaling theory ⋮ Matrix representation and gradient flows for NP-hard problems ⋮ Scaling and universality of the complexity of analog computation ⋮ A universal scaling theory for complexity of analog computation ⋮ Continuous dynamical systems that realize discrete optimization on the hypercube ⋮ Neurodynamical classifiers with low model complexity ⋮ The constrained Newton method on a Lie group and the symmetric eigenvalue problem ⋮ Analog computation with dynamical systems ⋮ INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION ⋮ A theory of complexity for continuous time systems ⋮ Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming

Cites Work

• Unnamed Item
• The local structure of Poisson manifolds
• A convexity theorem for isospectral manifolds of Jacobi matrices in a compact Lie algebra
• A new polynomial-time algorithm for linear programming
• Hyperplane sections of polyhedra, toroidal manifolds, and discrete groups in Lobachevskij space
• Simplex method and groups generated by reflections
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• The simplex method in coordinate-free formulation
• A new formulation of the generalized Toda lattice equations and their fixed point analysis via the momentum map
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Convexity and Commuting Hamiltonians
• Finitely many mass points on the line under the influence of an exponential potential -- an integrable system

This page was built for publication: Hamiltonian structure of dynamical systems which solve linear programming problems