Hamiltonian structure of dynamical systems which solve linear programming problems
- 1 November 1991
- journal article
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 53 (2-4), 217-232
- https://doi.org/10.1016/0167-2789(91)90062-e
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problemsLinear Algebra and its Applications, 1991
- A new formulation of the generalized Toda lattice equations and their fixed point analysis via the momentum mapBulletin of the American Mathematical Society, 1990
- Simplex method and groups generated by reflectionsActa Applicandae Mathematicae, 1990
- Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!Informs Journal on Applied Analytics, 1990
- A convexity theorem for isospectral manifolds of Jacobi matrices in a compact Lie algebraDuke Mathematical Journal, 1990
- Steepest descent, linear programming, and Hamiltonian flowsContemporary Mathematics, 1990
- Boundary Behavior of Interior Point Algorithms in Linear ProgrammingMathematics of Operations Research, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The simplex method in coordinate-free formulationCybernetics and Systems Analysis, 1983
- Convexity and Commuting HamiltoniansBulletin of the London Mathematical Society, 1982