Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems (Q2640437): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q114852091, #quickstatements; #temporary_batch_1705502051474 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114852091 / rank | |||
Normal rank | |||
Revision as of 15:41, 17 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems |
scientific article |
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
