The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
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
On 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
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Benson, S. J., Ye, Y., & Zhang, X. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497328008 · Cited by 276
Problems of distance geometry and convex properties of quadratic maps
Barvinok, A. I. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574037 · Cited by 226
A lower-bound method for the dimension-free measurement of internal consistency
Bentler, P. M. (1972) · Social Science Research · doi:10.1016/0049-089x(72)90082-8 · Cited by 111
Nonpolyhedral Relaxations of Graph-Bisection Problems
Poljak, S., & Rendl, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805024 · Cited by 89
A projected gradient algorithm for solving the maxcut SDP relaxation
Burer, S., & Monteiro, R. D. C. (2001) · Optimization methods & software · doi:10.1080/10556780108805818 · Cited by 73
Self-citationDesign and Performance of Parallel and Distributed Approximation Algorithms for Maxcut
Homer, S., & Peinado, M. (1997) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1381 · Cited by 56
Solving a class of semidefinite programs via nonlinear programming
Burer, S., Monteiro, R. D. C., & Zhang, Y. (2002) · Mathematical Programming · doi:10.1007/s101070100279 · Cited by 53
Self-citationCone-LP's and semidefinite programs: Geometry and a simplex-type method
Pataki, G. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61310-2_13 · Cited by 38
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
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.