The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Abstract
We derive some basic results on the geometry of semidefinite programming (SDP) and eigenvalue-optimization, i.e., the minimization of the sum of the k largest eigenvalues of a smooth matrix-valued function. We provide upper bounds on the rank of extreme matrices in SDPs, and the first theoretically solid explanation of a phenomenon of intrinsic interest in eigenvalue-optimization. In the spectrum of an optimal matrix, the kth and (k + 1)st largest eigenvalues tend to be equal and frequently have multiplicity greater than two. This clustering is intuitively plausible and has been observed as early as 1975. When the matrix-valued function is affine, we prove that clustering must occur at extreme points of the set of optimal solutions, if the number of variables is sufficiently large. We also give a lower bound on the multiplicity of the critical eigenvalue. These results generalize to the case of a general matrix-valued function under appropriate conditions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I
Fan, K. (1949) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.35.11.652 · Cited by 1,016
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
Convexity and Optimization in Finite Dimensions I
Stoer, J., & Witzgall, C. (1970) · Springer eBooks · doi:10.1007/978-3-642-46216-0 · Cited by 885
Large-Scale Optimization of Eigenvalues
Overton, M. L. (1992) · SIAM Journal on Optimization · doi:10.1137/0802007 · Cited by 209
A semidefinite framework for trust region subproblems with applications to large scale minimization
Rendl, F., & Wolkowicz, H. (1997) · Mathematical Programming · doi:10.1007/bf02614438 · Cited by 204
Lewis, A. S., & Overton, M. L. (1996) · Acta Numerica · doi:10.1017/s0962492900002646 · Cited by 190
Overton, M. L., & Womersley, R. S. (1993) · Mathematical Programming · doi:10.1007/bf01585173 · Cited by 189
Convex Analysis on the Hermitian Matrices
Lewis, A. S. (1996) · SIAM Journal on Optimization · doi:10.1137/0806009 · Cited by 187
Laplacian eigenvalues and the maximum cut problem
Delorme, C., & Poljak, S. (1993) · Mathematical Programming · doi:10.1007/bf01585184 · Cited by 179
Some geometric results in semidefinite programming
Ramana, M., & Goldman, A. J. (1995) · Journal of Global Optimization · doi:10.1007/bf01100204 · Cited by 162
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
Cullum, J. K., Donath, W. E., & Wolfe, P. (1975) · Mathematical programming studies · doi:10.1007/bfb0120698 · Cited by 122
On the Sum of the Largest Eigenvalues of a Symmetric Matrix
Overton, M. L., & Womersley, R. S. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613006 · Cited by 115
Approximate graph coloring by semidefinite programming
Karger, D. R., Motwani, R., & Sudan, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365710 · Cited by 106
Some applications of optimization in matrix theory
Wolkowicz, H. (1981) · Linear Algebra and its Applications · doi:10.1016/0024-3795(81)90143-9 · Cited by 62
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
Huang, Y., & Palomar, D. P. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2031732 · Cited by 561
Pólik, I., & Terlaky, T. (2007) · SIAM Review · doi:10.1137/s003614450444614x · Cited by 499
A Spectral Bundle Method for Semidefinite Programming
Helmberg, C., & Rendl, F. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497328987 · Cited by 436
Metadata
- Authors
- Pataki, G.
- Venue
- Mathematics of Operations Research
- Published
- 1998-05
- Volume
- 23
- Issue
- 2
- Pages
- 339-358
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2005102197
- Cited by
- 332
- References
- 19
- FWCI
- 2.76
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.