Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones

Authors:
S. H. Schmieta;F. Alizadeh
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
2001

Citing 0
Cited 6

A primal--dual symmetric relaxation for homogeneous conic systems

Journal of Complexity
A descent method for a reformulation of the second-order cone complementarity problem

Journal of Computational and Applied Mathematics
A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions

Computational Optimization and Applications
Smoothing algorithms for complementarity problems over symmetric cones

Computational Optimization and Applications
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

SIAM Review
The solution set structure of monotone linear complementarity problems over second-order cone

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones derivable from associative algebras. In particular, such analyses are extendible to the cone of positive semidefinite Hermitian matrices with complex and quaternion entries, and to the Lorentz cone. We prove the case of the Lorentz cone by using the embedding of its associated Jordan algebra in the Clifford algebra. As an example of such extensions we take Monterio's polynomial-time complexity analysis of the family of similarly scaled directions--introduced by Monteiro and Zhang (1998)--and generalize it to cone-LP over all representable symmetric cones.