Similarity and other spectral relations for symmetric cones.

*(English)*Zbl 0973.90093Summary: The similarity relations that are derived in this paper reduce to well-known results in the special case of symmetric matrices. In particular, for two positive definite matrices \(X\) and \(Y\), the square of the spectral geometric mean is known to be similar to the matrix product \(XY\). It is shown in this paper that this property carries over to symmetric cones. More elementary similarity relations, such as \(XY^2 X\sim YX^2Y\), are generalized as well. We also extend the result that the eigenvalues of a matrix product \(XY\) are less dispersed than the eigenvalues of the Jordan product \((XY+YX)/2\). The paper further contains a number of inequalities on norms and spectral values; this type of inequality is often used in the analysis of interior point methods (in optimization). We also derive an extension of Stein’s theorem to symmetric cones.

##### MSC:

90C46 | Optimality conditions and duality in mathematical programming |

15B48 | Positive matrices and their generalizations; cones of matrices |

17C99 | Jordan algebras (algebras, triples and pairs) |

PDF
BibTeX
XML
Cite

\textit{J. F. Sturm}, Linear Algebra Appl. 312, No. 1--3, 135--154 (2000; Zbl 0973.90093)

Full Text:
DOI

**OpenURL**

##### References:

[1] | F. Alizadeh, J.A. Haeberly, M.V. Nayakkankuppann, M. Overton, S. Schmieta, SDP - Pack User’s Guide, New York University, New York, USA, 1997 |

[2] | Alizadeh, F.; Haeberly, J.A.; Overton, M., Complementarity and nondegeneracy in semidefinite programming, Mathematical programming, 77, 2, 111-128, (1997) · Zbl 0890.90141 |

[3] | Alizadeh, F.; Haeberly, J.A.; Overton, M., Primal – dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM journal on optimization, 8, 3, 746-768, (1998) · Zbl 0911.65047 |

[4] | Ando, T., Concavity of certain maps and positive definite matrices and applications to Hadamard products, Linear algebra and its applications, 26, 203-241, (1979) · Zbl 0495.15018 |

[5] | Berkelaar, A.B.; Sturm, J.F.; Zhang, S., Polynomial primal – dual cone affine scaling for semidefinite programming, Applied numerical mathematics, 29, 317-333, (1999) · Zbl 0956.90025 |

[6] | Braun, H.; Koecher, M., Jordan algebren, (1966), Springer New York |

[7] | Faraut, J.; Korányi, A., Analysis on symmetric cones: Oxford mathematical monographs, (1994), Oxford University Press New York |

[8] | L. Faybusovich, Jordan algebras, symmetric cones and interior point methods, Technical Report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA, 1995 |

[9] | L. Faybusovich, Euclidean Jordan algebras and interior-point algorithms, in: Positivity, vol. 1, Kluwer Academic Publishers, Dordrecht, 1997, pp. 331-357 · Zbl 0973.90095 |

[10] | Faybusovich, L., Linear systems in Jordan algebras and primal – dual interior-point algorithms, Journal of computational and applied mathematics, 86, 149-175, (1997) · Zbl 0889.65066 |

[11] | L. Faybusovich, A Jordan-algebraic approach to potential-reduction algorithms, Technical Report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA, 1998 · Zbl 0996.65065 |

[12] | Güler, O., Barrier functions in interior point methods, Mathematics of operations research, 21, 860-885, (1996) · Zbl 0867.90090 |

[13] | Güler, O.; Tunçel, L., Characterization of the barrier parameter of homogeneous convex cones, Mathematical programming, 81, 55-76, (1998) · Zbl 0919.90124 |

[14] | Jordan, P.; Von Neumann, J.; Wigner, E., On algebraic generalization of the quantum mechanical formalism, Annals of mathematics, 36, 29-64, (1934) · JFM 60.0902.02 |

[15] | Koecher, M., Positivitätsbereiche in \(R\^{}\{n\}\), American journal of mathematics, 79, 575-596, (1957) · Zbl 0078.01205 |

[16] | Kojima, M.; Megiddo, N.; Noma, T.; Yoshise, A., A unified approach to interior point algorithms for linear complementarity problems, (1991), Springer Berlin · Zbl 0745.90069 |

[17] | Monteiro, R.D.C., Primal – dual path following algorithms for semidefinite programming, SIAM journal on optimization, 7, 3, 663-678, (1997) · Zbl 0913.65051 |

[18] | Nesterov, Y.; Todd, M.J., Self-scaled barriers and interior-point methods for convex programming, Mathematics of operations research, 22, 1, 1-42, (1997) · Zbl 0871.90064 |

[19] | Nesterov, Y.; Todd, M.J., Primal – dual interior-point methods for self-scaled cones, SIAM journal on optimization, 8, 324-364, (1998) · Zbl 0922.90110 |

[20] | J.M. Ortega, Matrix Theory: A Second Course, The University Series in Mathematics, Plenum Press, New York, 1987 |

[21] | S.H. Schmieta, F. Alizadeh, Associative algebras, symmetric cones and polynomial time interior point algorithms, Technical report, RUTCOR, Rutgers University, NJ, USA, June 1998 · Zbl 1073.90572 |

[22] | J.F. Sturm, Primal-Dual Interior Point Approach to Semidefinite Programming, Tinbergen Institute Research Series, vol. 156, Thesis Publishers, Amsterdam, The Netherlands, 1997 |

[23] | J.F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, in: Interior Point Methods (CD supplement with software) (special issue), Optimization Methods and Software 11-12 (1999) 625-653 |

[24] | Sturm, J.F.; Zhang, S., Symmetric primal – dual path following algorithms for semidefinite programming, Applied numerical mathematics, 29, 301-315, (1999) · Zbl 0956.90027 |

[25] | Todd, M.J., A study of search directions in interior-point methods for semidefinite programming, Optimization methods and software, 11-12, 1-46, (1999) · Zbl 0971.90109 |

[26] | Todd, M.J.; Toh, K.C.; Tütüncü, R.H., On the nesterov – todd direction in semidefinite programming, SIAM journal on optimization, 8, 3, 769-796, (1998) · Zbl 0913.90217 |

[27] | K.C. Toh, M.J. Todd, R.H. Tütüncü, SDPT3 - a MATLAB package for semidefinite programming, version 1.3, in: Interior Point Methods (CD supplement with software) (special issue), Optimization Methods and Software 11-12 (1999) 545-581 |

[28] | T. Tsuchiya, A convergence analysis of the scaling-invariant primal – dual path-following algorithm for second-order cone programming, in: Interior Point Methods (CD supplement with software) (special issue), Optimization Methods and Software 11-12 (1999) 141-182 |

[29] | L. Tunçel, Convex optimization: barrier functions and interior-point methods, Technical Report B-336, Department of Information Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152, Japan, 1998 |

[30] | Tunçel, L., Primal – dual symmetry and scale invariance of interior point algorithms for convex optimization, Mathematics of operations research, 23, (1998) · Zbl 0977.90037 |

[31] | Xue, G.; Ye, Y., An efficient algorithm for minimizing a sum of Euclidean norms with applications, SIAM journal on optimization, 7, 4, 1017-1036, (1997) · Zbl 0885.68074 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.