Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T11:02:21.606Z Has data issue: false hasContentIssue false
  • English
  • Français

Isospectral flows and linear programming

Published online by Cambridge University Press:  17 February 2009

U. Helmke
U. Helmke
Affiliation:
University of Regensburg, Department of Mathematics, 8400 Regensburg, Germany.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Brockett has studied the isospectral flow Ḣ = [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 ε-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.

Type
Research Article
Information
The ANZIAM Journal , Volume 34 , Issue 4 , April 1993 , pp. 495 - 510
Copyright
Copyright © Australian Mathematical Society 1993

References

[1] Bloch, A. M., “Steepest descent, linear programming and Hamiltonian flows”, Contemporary Math. 114 (1990) 77–88.CrossRefGoogle Scholar
[2] Brockett, R. W., “Dynamical systems that sort lists and solve linear programming problems”, Proc. 21th IEEE Conference on Decision and Control, (1988) 779–803.Google Scholar
[3] Faibusovich, L., “Hamiltonian structure of dynamical systems which solve linear programming problems”, preprint (1990).Google Scholar
[4] Helmke, U., “Isospectral flows on symmetric matrices and the Riccati equation”, Systems and Control Letters 16 (1991) 159–166.CrossRefGoogle Scholar
[5] Karmarkar, N., “A new polynomial time algorithm for linear programming”, Combinatorica 4 (1984) 373–395.CrossRefGoogle Scholar
[6] Karmarkar, N., “Riemannian geometry underlying interior point methods for linear programming”, Physica D53 (1991) 217–232.Google Scholar
[7] Oja, E., “A simplified neuron model as a principal component analyzer”, J. Math. Biology 15 (1982) 267–273.CrossRefGoogle ScholarPubMed
[8] Schuster, P., Sigmund, K. and Worff, R., “Dynamical systems under constant organisation I: Topological analysis of a family of nonlinear differential equations”, Bull. Math. Biophys. 40 (1978) 743–769.Google Scholar
[9] Tomei, C., “The topology of isospectral manifolds of tridiagonal matrices”, Duke Math. J. 51 (1984) 981–996.CrossRefGoogle Scholar
[10] Zeeman, E. C., “Population dynamics from game theory”, in Global Theory of Dynamical Systems, eds. Nitecki, Z. and Robinson, C., Lecture Notes in Mathematics 819 (1980), Springer-Verlag, Berlin, 471–497.CrossRefGoogle Scholar