J Austral Math Soc Ser B 34 pp495--510, 1993.

Isospectral flows and linear programming

U. Helmke

Abstract

Brockett has studied the isospectral flow H ' = [H, [H, N]], with [A, B] = AB - BA, on spaces of real symmetric matrices. The flow diagonalises real symmetric matrices and can be used to solve linear programming problems with compact convex constraints. We show that the flow converges exponentially fast to the optimal solution of the programming problem and we give explicit estimates for the time needed by the flow to approach an e-neighbourhood of the optimum. An interior point algorithm for the standard simplex is analysed in detail and a comparison is made with a continuous time version of Karmarkar algorithm.

Browse the article

Author

U. Helmke

University of Regensburg, Department of Mathematics, 8400 Regensburg, Germany.