On the Sum of the Largest Eigenvalues of a Symmetric Matrix

DOI10.1137/0613006zbMath0747.15005OpenAlexW2015492922MaRDI QIDQ3988974

Michael L. Overton, Robert S. Womersley

Publication date: 28 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0613006

zbMATH Keywords

convex hullsymmetric matrixprojection matricesdoubly stochastic matricesBirkhoff theoremextremal propertysum of the largest eigenvalues

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Miscellaneous inequalities involving matrices (15A45) Stochastic matrices (15B51)

Related Items (35)

Computing the nearest low-rank correlation matrix by a simplified SQP algorithm ⋮ On minimizing the largest eigenvalue of a symmetric matrix ⋮ On extremum properties of orthogonal quotients matrices ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Generalized derivatives of eigenvalues of a symmetric matrix ⋮ Unnamed Item ⋮ On maximal relative projection constants ⋮ A projection technique for partitioning the nodes of a graph ⋮ An inequality for eigenvalues of symmetric matrices with applications to max-cuts and Graph Energy^∗ ⋮ The spectral bundle method with second-order information ⋮ Discontinuous piecewise linear optimization ⋮ Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices ⋮ A new perspective on low-rank optimization ⋮ Unnamed Item ⋮ On the generalized trace ratio problem ⋮ A spectral approach to bandwidth and separator problems in graphs ⋮ Computing maximin efficient experimental designs using the methods of semidefinite programming ⋮ Exact \(k\)-component graph learning for image clustering ⋮ Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs ⋮ Unnamed Item ⋮ First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints ⋮ Supervised dimensionality reduction via sequential semidefinite programming ⋮ On the extreme points of a family of matrices related to a theorem of Birkhoff ⋮ Semidefinite programming and combinatorial optimization ⋮ ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Method of centers for minimizing generalized eigenvalues ⋮ A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix ⋮ Model reduction and neural networks for parametric PDEs ⋮ CONVEX HULL PRESENTATION OF A QUADRATICALLY CONSTRAINED SET AND ITS APPLICATION IN SOLVING QUADRATIC PROGRAMMING PROBLEMS ⋮ Computation of maximal projection constants ⋮ Sparsistency and agnostic inference in sparse PCA ⋮ A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix ⋮ On matrix approximation problems with Ky Fan \(k\) norms ⋮ Robust computation of linear models by convex relaxation

This page was built for publication: On the Sum of the Largest Eigenvalues of a Symmetric Matrix