论文信息 - Euclidean Jordan Algebras and Interior-point Algorithms

Euclidean Jordan Algebras and Interior-point Algorithms

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.

L. Faybusovich

[1] M. Koecher. Jordan algebras and their applications , 1962 .

[2] Konstantin Aleksandrovich Zhevlakov,et al. Rings that are nearly associative , 1982 .

[3] Y. Nesterov,et al. Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming , 1994 .

[4] J. Faraut,et al. Analysis on Symmetric Cones , 1995 .

[5] Harald Upmeier,et al. Toeplitz Operators and Index Theory in Several Complex Variables , 1995 .

[6] Leonid Faybusovich,et al. Semidefinite Programming: A Path-Following Algorithm for a Linear-Quadratic Functional , 1996, SIAM J. Optim..

[7] Pseudodifferential Analysis on Symmetric Cones , 1996 .

[8] John B. Moore,et al. Infinite-dimensional quadratic optimization: Interior-point methods and control applications , 1997 .

[9] L. Faybusovich. Linear systems in Jordan algebras and primal-dual interior-point algorithms , 1997 .

[10] Stephen J. Wright. Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[11] Shinji Hara,et al. Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..