American Institute of Mathematical Sciences

Advanced
2016, 6(2): 115-126. doi: 10.3934/naco.2016003

Derivatives of eigenvalues and Jordan frames

Manuel V. C. Vieira 1,

1. 

Departamento de Matemática, Faculdade de Ciências e Tecnologia & CMA, Universidade Nova de Lisboa, 2829-516 Caparica, Portugal

Received  January 2015 Revised  May 2016 Published  June 2016

Every element in a Euclidean Jordan algebra has a spectral decomposition. This spectral decomposition is generalization of the spectral decompositions of a matrix. In the context of Euclidean Jordan algebras, this is written using eigenvalues and the so-called Jordan frame. In this paper we deduce the derivative of eigenvalues in the context of Euclidean Jordan algebras. We also deduce the derivative of the elements of a Jordan frame associated to the spectral decomposition.
Keywords: symmetric cones, differentiability., eigenvalues, Euclidean Jordan algebras.
Mathematics Subject Classification: Primary: 90C25, 17C27; Secondary: 58B1.
Citation: Manuel V. C. Vieira. Derivatives of eigenvalues and Jordan frames. Numerical Algebra, Control & Optimization, 2016, 6 (2) : 115-126. doi: 10.3934/naco.2016003
References:
[1]

M. Baes, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras,, Linear Algebra Appl., 422 (2007), 664.  doi: 10.1016/j.laa.2006.11.025.  Google Scholar

[2]

Y. Q. Bai, M. El Ghami and C. Roos, A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization,, SIAM Journal on Optimization, 15 (2004), 101.  doi: 10.1137/S1052623403423114.  Google Scholar

[3]

J. Faraut and A. Korányi, Analysis on Symmetric Cones,, The Clarendon Press Oxford University Press, (1994).   Google Scholar

[4]

L. Faybusovich, Linear systems in Jordan algebras and primal-dual interior-point algorithms,, J. Comput. Appl. Math., 86 (1997), 149.  doi: 10.1016/S0377-0427(97)00153-2.  Google Scholar

[5]

L. Faybusovich, Euclidean Jordan algebras and interior-point algorithms,, Positivity, 1 (1997), 331.  doi: 10.1023/A:1009701824047.  Google Scholar

[6]

L. Faybusovich and R. Arana, A long-step primal-dual algorithm for the symmetric programming problem,, Systems Control Lett., 43 (2001), 3.  doi: 10.1016/S0167-6911(01)00092-5.  Google Scholar

[7]

L. Faybusovich, A Jordan-algebraic approach to potential-reduction algorithms,, Math. Z., 239 (2002), 117.  doi: 10.1007/s002090100286.  Google Scholar

[8]

G. Gu, M. Zangiabadi and C. Roos, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization,, European Journal of Operational Research, 214 (2011), 473.  doi: 10.1016/j.ejor.2011.02.022.  Google Scholar

[9]

R. A. Hauser and O. Güler, Self-scaled barrier functions on symmetric cones and their classification,, Found. Comput. Math., 2 (2002), 121.   Google Scholar

[10]

R. A. Hauser and Y. Lim, Self-scaled barriers for irreducible symmetric cones,, SIAM J. Optim., 12 (2002), 715.  doi: 10.1137/S1052623400370953.  Google Scholar

[11]

Z.-H. Huang and T. Ni, Smoothing algorithms for complementarity problems over symmetric cones,, Comput. Optim. Appl., 450 (2010), 557.  doi: 10.1007/s10589-008-9180-y.  Google Scholar

[12]

B. Kheirfam, A corrector-predictor path-following method for convex quadratic symmetric cone optimization,, Journal of Optimization Theory and Applications, 164 (2015), 246.  doi: 10.1007/s10957-014-0554-2.  Google Scholar

[13]

M. Kojima and M. Muramatsu, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones,, Math. Program., 110 (2007), 315.  doi: 10.1007/s10107-006-0004-5.  Google Scholar

[14]

P. Lancaster, On eigenvalues of matrices dependent on a parameter,, Numer. Math., 6 (1964), 377.   Google Scholar

[15]

G. Lesaja and C. Roos, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones,, Journal of Optimization Theory and Applications, 150 (2011), 444.  doi: 10.1007/s10957-011-9848-9.  Google Scholar

[16]

H. Liu, X. Yang and C. Liu, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming,, Journal of Optimization Theory and Applications, 158 (2013), 796.  doi: 10.1007/s10957-013-0303-y.  Google Scholar

[17]

Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Algorithms in Convex Programming,, SIAM: Studies in Applied and Numerical Mathematics, (1994).  doi: 10.1137/1.9781611970791.  Google Scholar

[18]

S. H. Schmieta and F. Alizadeh, Extension of primal-dual interior point algorithms to symmetric cones,, Math. Program., 96 (2003), 409.  doi: 10.1007/s10107-003-0380-z.  Google Scholar

[19]

S. H. Schmieta and F. Alizadeh, Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones,, Math. Oper. Res., 26 (2001), 543.  doi: 10.1287/moor.26.3.543.10582.  Google Scholar

[20]

M. V. C. Vieira, Interior-point methods based on kernel functions for symmetric optimization,, Optimization Methods and Software, 27 (2012), 513.  doi: 10.1080/10556788.2010.544877.  Google Scholar

[21]

G. Q. Wang, C. J. Yub and K. L. Teo, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization,, Applied Mathematics and Computation, 221 (2013), 329.  doi: 10.1016/j.amc.2013.06.064.  Google Scholar

[22]

Z. Yu, Y. Zhu and Q. Cao, On the convergence of central path and generalized proximal point method for symmetric cone linear programming,, Applied Mathematics & Information Sciences, 7 (2103), 2327.  doi: 10.12785/amis/070624.  Google Scholar

show all references

References:
[1]

M. Baes, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras,, Linear Algebra Appl., 422 (2007), 664.  doi: 10.1016/j.laa.2006.11.025.  Google Scholar

[2]

Y. Q. Bai, M. El Ghami and C. Roos, A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization,, SIAM Journal on Optimization, 15 (2004), 101.  doi: 10.1137/S1052623403423114.  Google Scholar

[3]

J. Faraut and A. Korányi, Analysis on Symmetric Cones,, The Clarendon Press Oxford University Press, (1994).   Google Scholar

[4]

L. Faybusovich, Linear systems in Jordan algebras and primal-dual interior-point algorithms,, J. Comput. Appl. Math., 86 (1997), 149.  doi: 10.1016/S0377-0427(97)00153-2.  Google Scholar

[5]

L. Faybusovich, Euclidean Jordan algebras and interior-point algorithms,, Positivity, 1 (1997), 331.  doi: 10.1023/A:1009701824047.  Google Scholar

[6]

L. Faybusovich and R. Arana, A long-step primal-dual algorithm for the symmetric programming problem,, Systems Control Lett., 43 (2001), 3.  doi: 10.1016/S0167-6911(01)00092-5.  Google Scholar

[7]

L. Faybusovich, A Jordan-algebraic approach to potential-reduction algorithms,, Math. Z., 239 (2002), 117.  doi: 10.1007/s002090100286.  Google Scholar

[8]

G. Gu, M. Zangiabadi and C. Roos, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization,, European Journal of Operational Research, 214 (2011), 473.  doi: 10.1016/j.ejor.2011.02.022.  Google Scholar

[9]

R. A. Hauser and O. Güler, Self-scaled barrier functions on symmetric cones and their classification,, Found. Comput. Math., 2 (2002), 121.   Google Scholar

[10]

R. A. Hauser and Y. Lim, Self-scaled barriers for irreducible symmetric cones,, SIAM J. Optim., 12 (2002), 715.  doi: 10.1137/S1052623400370953.  Google Scholar

[11]

Z.-H. Huang and T. Ni, Smoothing algorithms for complementarity problems over symmetric cones,, Comput. Optim. Appl., 450 (2010), 557.  doi: 10.1007/s10589-008-9180-y.  Google Scholar

[12]

B. Kheirfam, A corrector-predictor path-following method for convex quadratic symmetric cone optimization,, Journal of Optimization Theory and Applications, 164 (2015), 246.  doi: 10.1007/s10957-014-0554-2.  Google Scholar

[13]

M. Kojima and M. Muramatsu, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones,, Math. Program., 110 (2007), 315.  doi: 10.1007/s10107-006-0004-5.  Google Scholar

[14]

P. Lancaster, On eigenvalues of matrices dependent on a parameter,, Numer. Math., 6 (1964), 377.   Google Scholar

[15]

G. Lesaja and C. Roos, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones,, Journal of Optimization Theory and Applications, 150 (2011), 444.  doi: 10.1007/s10957-011-9848-9.  Google Scholar

[16]

H. Liu, X. Yang and C. Liu, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming,, Journal of Optimization Theory and Applications, 158 (2013), 796.  doi: 10.1007/s10957-013-0303-y.  Google Scholar

[17]

Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Algorithms in Convex Programming,, SIAM: Studies in Applied and Numerical Mathematics, (1994).  doi: 10.1137/1.9781611970791.  Google Scholar

[18]

S. H. Schmieta and F. Alizadeh, Extension of primal-dual interior point algorithms to symmetric cones,, Math. Program., 96 (2003), 409.  doi: 10.1007/s10107-003-0380-z.  Google Scholar

[19]

S. H. Schmieta and F. Alizadeh, Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones,, Math. Oper. Res., 26 (2001), 543.  doi: 10.1287/moor.26.3.543.10582.  Google Scholar

[20]

M. V. C. Vieira, Interior-point methods based on kernel functions for symmetric optimization,, Optimization Methods and Software, 27 (2012), 513.  doi: 10.1080/10556788.2010.544877.  Google Scholar

[21]

G. Q. Wang, C. J. Yub and K. L. Teo, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization,, Applied Mathematics and Computation, 221 (2013), 329.  doi: 10.1016/j.amc.2013.06.064.  Google Scholar

[22]

Z. Yu, Y. Zhu and Q. Cao, On the convergence of central path and generalized proximal point method for symmetric cone linear programming,, Applied Mathematics & Information Sciences, 7 (2103), 2327.  doi: 10.12785/amis/070624.  Google Scholar

[1]

Ying Lin, Qi Ye. Support vector machine classifiers by non-Euclidean margins. Mathematical Foundations of Computing, 2020, 3 (4) : 279-300. doi: 10.3934/mfc.2020018
[2]

Lei Liu, Li Wu. Multiplicity of closed characteristics on $ P $-symmetric compact convex hypersurfaces in $ \mathbb{R}^{2n} $. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020378

 Impact Factor: 

Tools

Metrics

  • PDF downloads (90)
  • HTML views (0)
  • Cited by (0)

Other articles
by authors

[Back to Top]

Copyright © 2020 American Institute of Mathematical Sciences