Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
type: Item
instance of: scholarly article
title: Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
zbMATH Open document ID: 0719.90045
DOI: 10.1016/0024-3795(91)90021-N
published in: Linear Algebra and its Applications
publication date: 1991-01-01T00:00:00Z
review text: 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.
reviewed by: T. F. Filippova
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 15A24
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 4187448
zbMATH Keywords: gradient flow
zbMATH Keywords: stability
zbMATH Keywords: list sorting
zbMATH Keywords: Lie bracket
Wikidata QID: Q114852091
author: Roger W. Brockett
MaRDI profile type: Publication
cites work: Least squares matching problems
cites work: Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
cites work: On convexity, the Weyl group and the Iwasawa decomposition
cites work: Ordinary Differential Equations and the Symmetric Eigenvalue Problem
cites work: On the Continuous Realization of Iterative Processes
cites work: Q5812325
cites work: Assembling a rearrangement
cites work: Inequalities: theory of majorization and its applications
description: scientific article