The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
Open accessAbstract
We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization $X=YY^T$, where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization $X=YY^T$ leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Cited by
PCCA: A new approach for distance learning from sparse pairwise constraints
Mignon, A., & Jurie, F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247987 · Cited by 592
Stochastic Gradient Descent on Riemannian Manifolds
Bonnabel, S. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2254619 · Cited by 540
Discriminative clustering for image co-segmentation
Joulin, A., Bach, F., & Ponce, J. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539868 · Cited by 438
Self-citationImplicit Regularization in Matrix Factorization
Gunasekar, S., Woodworth, B., Bhojanapalli, S., Neyshabur, B., & Srebro, N. (2018) · 2018 Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2018.8503198 · Cited by 170
Implicit Bias of Gradient Descent on Linear Convolutional Networks
Gunasekar, S., Lee, J., Soudry, D., & Srebro, N. (2018) · arXiv · doi:10.48550/arxiv.1806.00468 · Cited by 75
Metadata
- Authors
- Journée, M., Bach, F., Absil, P.-A., & Sepulchre, R.
- Venue
- SIAM Journal on Optimization
- Published
- 2010-01
- Volume
- 20
- Issue
- 5
- Pages
- 2327-2351
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2117198760
- Cited by
- 209
- References
- 2
- FWCI
- 12.08
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices. https://app.cochat.ai/papers/10.1137/080731359
- The paper
- Journée, M., Bach, F., Absil, P.-A., & Sepulchre, R. (2010). Low-Rank Optimization on the Cone of Positive Semidefinite Matrices. SIAM Journal on Optimization. https://doi.org/10.1137/080731359
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.