The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Theory of semidefinite programming for Sensor Network Localization
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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Some distance properties of latent root and vector methods used in multivariate analysis
GOWER, J. C. (1966) · Biometrika · doi:10.1093/biomet/53.3-4.325 · Cited by 4,293
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Savvides, A., Han, C.-C., & Strivastava, M. B. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381693 · Cited by 2,694
Multidimensional Scaling: I. Theory and Method
Torgerson, W. S. (1952) · Psychometrika · doi:10.1007/bf02288916 · Cited by 2,126
Convex position estimation in wireless sensor networks
Doherty, L., pister, K. S. J., & El Ghaoui, L. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916662 · Cited by 1,632
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
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
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
Savarese, C., Rabaey, J. M., & Langendoen, K. G. (2002) · Cited by 846
Discussion of a Set of Points in Terms of their Mutual Distances
Young, G., & Householder, A. S. (1938) · Psychometrika · doi:10.1007/bf02287916 · Cited by 753
Barvinok, A. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/054 · Cited by 660
Semidefinite programming for ad hoc wireless sensor network localization
Biswas, P., & Ye, Y. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984630 · Cited by 573
Self-citationRigidity, computation, and randomization in network localization
Eren, T., Goldenberg, O. K., Whiteley, W., Yang, Y. R., Morse, A. S., Anderson, B. D. O., & Belhumeur, P. N. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354686 · Cited by 517
Schoenberg, I. J. (1935) · The Annals of Mathematics · doi:10.2307/1968654 · Cited by 453
Graver, J., Servatius, B., & Servatius, H. (1993) · Graduate Studies in Mathematics · doi:10.1090/gsm/002 · Cited by 315
Problems of distance geometry and convex properties of quadratic maps
Barvinok, A. I. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574037 · Cited by 226
Global Continuation for Distance Geometry Problems
Moré, J. J., & Wu, Z. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495283024 · Cited by 208
On the Computational Complexity of Sensor Network Localization
Aspnes, J., Goldenberg, D., & Yang, Y. R. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27820-7_5 · Cited by 188
Convergence behavior of interior-point algorithms
Güler, O., & Ye, Y. (1993) · Mathematical Programming · doi:10.1007/bf01580610 · Cited by 160
Self-citationGraph rigidity via Euclidean distance matrices
Alfakih, A. Y. (2000) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(00)00066-5 · Cited by 41
Extensions of Classical Multidimensional Scaling via Variable Reduction
Trosset, M. W. (2002) · Computational Statistics · doi:10.1007/s001800200099 · Cited by 24
Cited by
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
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
Self-citationExact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
A Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
Euclidean Distance Matrices: Essential theory, algorithms, and applications
Dokmanic, I., Parhizkar, R., Ranieri, J., & Vetterli, M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2398954 · Cited by 611
Metadata
- Authors
- So, A. M.-C., & Ye, Y.
- Venue
- Mathematical Programming
- Published
- 2006-09-19
- Volume
- 109
- Issue
- 2-3
- Pages
- 367-384
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W3138835833
- Cited by
- 326
- References
- 20
- FWCI
- 16.92
- 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.