ISOSPECTRAL FLOWS AND LINEAR-PROGRAMMING

HELMKE, U (1993) ISOSPECTRAL FLOWS AND LINEAR-PROGRAMMING. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES B-APPLIED MATHEMATICS, 34. pp. 495-510. ISSN 0334-2700,

Full text not available from this repository.

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 epsilon-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.

Item Type:	Article
Uncontrolled Keywords:	MATRICES; MODEL;
Depositing User:	Dr. Gernot Deinzer
Last Modified:	19 Oct 2022 08:42
URI:	https://pred.uni-regensburg.de/id/eprint/54035

Actions (login required)

View Item