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

@article{Schmieta2001AssociativeAJ,
  title={Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones},
  author={Stefan Schmieta and Farid Alizadeh},
  journal={Math. Oper. Res.},
  year={2001},
  volume={26},
  pages={543-564}
}
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… 
Extension of primal-dual interior point algorithms to symmetric cones
Abstract. In this paper we show that the so-called commutative class of primal-dual interior point algorithms which were designed by Monteiro and Zhang for semidefinite programming extends
Jordan algebraic approach to symmetric optimization
TLDR
A generalization of interior-point methods for linear optimization based on kernel functions to symmetric optimization covering the three standard cases of conic optimization is presented.
An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
TLDR
This theory transparently unifies presentation and analysis of issues such as degeneracy and complementarity, and proofs of polynomial time convergence of interior point methods in linear, second order and semidefinite optimization problems.
A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones
In this paper, we present a new class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones based on a parametric kernel function,
Smoothing algorithms for complementarity problems over symmetric cones
TLDR
This paper first investigates a smoothing function in the context of symmetric cones and shows that it is coercive under suitable assumptions, and extends two generic frameworks of smoothing algorithms to solve the complementarity problems over asymmetric cones, and proves the proposed algorithms are globally convergent under suitable assumption.
Euclidean Jordan algebras and some conditions over the spectra of a strongly regular graph
Let G be a primitive strongly regular graph G such that the regularity is less than half of the order of G and A its matrix of adjacency, and let 𝒜 be the real Euclidean Jordan algebra of real
A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming
TLDR
An inexact primal-dual infeasible path-following algorithm for convex quadratic programming over symmetric cones and its polynomial iteration complexity analysis give a unified treatment for a number of previous algorithms and their complexity analysis.
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
TLDR
The primal-dual Dikin-type affine scaling method is generalized to symmetric conic optimization using the notion of Euclidean Jordan algebras and is shown to be viable and robust when compared to SeDuMi, MOSEK and SDPT3.
The Q Method for Symmetric Cone Programming
TLDR
It is proved that in the presence of certain non-degeneracies the Jacobian of the Newton system is nonsingular at the optimum and can be used to “warm-start” a slightly perturbed symmetric cone program.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
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
Analysis on Symmetric Cones
I. Convex cones II. Jordan algebras III. Symmetric cones and Euclidean Jordan algebras IV. The Peirce decomposition in a Jordan algebra V. Classification of Euclidean Jordan algebras VI. Polar
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
TLDR
It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.
Primal-Dual Interior-Point Methods for Self-Scaled Cones
TLDR
This paper presents efficiency estimates for several symmetric primal-dual methods that can loosely be classified as path-following methods for convex programming problems expressed in conic form when the cone and its associated barrier are self-scaled.
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
TLDR
The analogue of Karmarkar's projective transformation and logarithmic barrier function are built and this allows to extend “word by word” the method of KARMarkar for LP to QCQP and allows to obtain a similar polynomial worst-case bound for the number of iterations.
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
TLDR
The polynomial convergence of primal-dual algorithms for SOCP based on a family of directions that is a natural extension of the Monteiro-Zhang (MZ) family for semidefinite programming is established for the first time.
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
TLDR
The aim of this paper is to establish a theoretical basis of interior-point methods with the use of Newton directions toward the central trajectory for the monotone SDLCP.
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
TLDR
It is shown that within the class of algorithms studied in this paper, the one based on the Nesterov—Todd direction has the lowest possible iteration-complexity bound that can provably be derived from the analysis.
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
TLDR
This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled, with long-step and symmetric primal-dual methods.
...
1
2
3
4
...