Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
The paper deals with the properties of the matrix differential equation \(H=[H,[H,N]]\) where [A,B] denotes the Lie bracket for the matrices A, B. The author uses this equation to solve the linear programming problem with a bounded polytope as constraint set. Some applications in combinatorial optimization are also given.
scientific article