When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?

DOI10.1016/0024-3795(92)90173-8zbMath0756.15017OpenAlexW2039500007MaRDI QIDQ1187386

Dongyi Ye

Publication date: 23 July 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90173-8

zbMATH Keywords

convexity of the greatest eigenvaluereal symmetric matrix-valued function

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Matrices over function rings in one or more variables (15A54)

Related Items (1)

Negative answer to the conjecture on the convexity of the greatest eigenvalue

Cites Work

• Unnamed Item
• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
• Semi-Definite Matrix Constraints in Optimization
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix

This page was built for publication: When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?