Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems (Q2640437)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4187448
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems |
scientific article; zbMATH DE number 4187448 |
Statements
Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems (English)
0 references
1991
0 references
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.
0 references
gradient flow
0 references
stability
0 references
list sorting
0 references
Lie bracket
0 references
0.7618647813796997
0 references
0.7594752311706543
0 references
0.7562591433525085
0 references
