A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
- 1 October 1993
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 2 (2) , 107-127
- https://doi.org/10.1007/bf01299152
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrixPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On analyticity of functions involving eigenvaluesLinear Algebra and its Applications, 1994
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matricesMathematical Programming, 1993
- On Minimizing the Maximum Eigenvalue of a Symmetric MatrixSIAM Journal on Matrix Analysis and Applications, 1988
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- An Algorithm for Partitioning the Nodes of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- Analysis of feedback systems with structured uncertaintiesIEE Proceedings D Control Theory and Applications, 1982
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- The minimization of certain nondifferentiable sums of eigenvalues of symmetric matricesPublished by Springer Nature ,1975
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960