Euclidean Jordan Algebras and Interior-point Algorithms |
| |
Authors: | Faybusovich Leonid |
| |
Institution: | (1) Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556-5683, USA |
| |
Abstract: | We provide an introduction to the theory of interior-point algorithms of optimization based on the theory of Euclidean Jordan algebras. A short-step path-following algorithm for the convex quadratic problem on the domain, obtained as the intersection of a symmetric cone with an affine subspace, is considered. Connections with the Linear monotone complementarity problem are discussed. Complexity estimates in terms of the rank of the corresponding Jordan algebra are obtained. Necessary results from the theory of Euclidean Jordan algebras are presented. |
| |
Keywords: | Jordan algebras Interior-point methods Complexity estimates |
本文献已被 SpringerLink 等数据库收录! |
|