A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 3×
“For the full details on the maxcut SDP relaxation, we refer the reader to [13].”
MethodOn the Shannon capacity of a graph
Lovasz, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,624
Handbook of Semidefinite Programming
(2000) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-4381-7 · Cited by 781
Lower Bounds for the Partitioning of Graphs
Donath, W. E., & Hoffman, A. J. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.175.0420 · Cited by 660
Cliques, Coloring, and Satisfiability
(1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026 · Cited by 476
A Spectral Bundle Method for Semidefinite Programming
Helmberg, C., & Rendl, F. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497328987 · Cited by 436
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Pataki, G. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.2.339 · Cited by 332
Cited by
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Empirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772755 · Cited by 918
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
A feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849
Unsupervised Learning of Image Manifolds by Semidefinite Programming
Weinberger, K. Q., & Saul, L. K. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-4939-z · Cited by 692
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
Low-Rank Matrix Completion by Riemannian Optimization
Vandereycken, B. (2013) · SIAM Journal on Optimization · doi:10.1137/110845768 · Cited by 491
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
Blind Deconvolution Using Convex Programming
Ahmed, A., Recht, B., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2294644 · Cited by 387
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
“We have also left out several important nonconvex problems and methods in order to stay focused, including but not limited to (1) blind calibration and finding sparse vectors in a subspace [203]–[205]; (2) tensor completion, decomposition and mixture models [140], [206]–[209]; (3) parameter recovery and inverse proble…”
MethodAlternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
Local Minima and Convergence in Low-Rank Semidefinite Programming
Burer, S., & Monteiro, R. D. C. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0564-1 · Cited by 347
Self-citationAngular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
“For our SDP experiments we used the software SDPT3 [35,37] and SDPLR [5] in MATLAB.”
MethodExperimental robustness of Fourier ptychography phase retrieval algorithms
Yeh, L.-H., Dong, J., Zhong, J., Tian, L., Chen, M., Tang, G., Soltanolkotabi, M., & Waller, L. (2015) · Optics Express · doi:10.1364/oe.23.033214 · Cited by 320
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Ensemble Pruning Via Semi-definite Programming
Zhang, Y., Samuel Burer, A., & Street, W. N. (2006) · doi:10.5555/1248547.1248595 · Cited by 258
Exact and stable recovery of rotations for robust synchronization
Wang, L., & Singer, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat005 · Cited by 178
Singer, A., & Shkolnisky, Y. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090767777 · Cited by 178
“The SDP was solved using SDPLR, a package for solving large-scale SDP problems [30] in MATLAB.”
MethodImplicit 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
Application of fermionic marginal constraints to hybrid quantum algorithms
Rubin, N. C., Babbush, R., & McClean, J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab919 · Cited by 152
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
“…sufficient over-parameterization (as is the case with our settings), loss landscape of linear models are well behaved and all local minima are global minima making the problem tractable Burer and Monteiro [2003], Journée et al. [2010], Kawaguchi [2016], Nguyen and Hein [2017], Lee et al. [2016].”
BackgroundBridging Classical and Quantum with SDP initialized warm-starts for QAOA
Tate, R., Farhadi, M., Herold, C., Mohler, G., & Gupta, S. (2020) · arXiv · doi:10.48550/arxiv.2010.14021 · Cited by 61
Towards large-scale quantum optimization solvers with few qubits
Sciorilli, M., Borges, L., Patti, T. L., García-Martín, D., Camilo, G., Anandkumar, A., & Aolita, L. (2025) · Nature Communications · doi:10.1038/s41467-024-55346-z · Cited by 47
“[35]).”
Influential
Metadata
- Authors
- Burer, S., & Monteiro, R. D. C.
- Venue
- Mathematical Programming
- Published
- 2003-02-01
- Volume
- 95
- Issue
- 2
- Pages
- 329-357
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2143075842
- Cited by
- 770
- References
- 18
- FWCI
- 13.89
- 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.