The DOI matches its Crossref record.
Global Continuation for Distance Geometry Problems
Abstract
Distance geometry problems arise in the determination of protein structure. We consider the case where only a subset of the distances between atoms is given and formulate this distance geometry problem as a global minimization problem with special structure. We show that global smoothing techniques and a continuation approach for global optimization can be used to determine global solutions of this problem reliably and efficiently. The global continuation approach determines a global solution with less computational effort than is required by a standard multistart algorithm. Moreover, the continuation approach usually finds the global solution from any given starting point, while the multistart algorithm tends to fail.
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
Cited by
Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553380 · Cited by 5,366
Learning Deep Architectures for AI
Bengio, Y. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982957 · Cited by 4,941
Handbook of Global Optimization
(1995) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4615-2025-2 · Cited by 1,628
An, L. T. H., & Tao, P. D. (2005) · Annals of Operations Research · doi:10.1007/s10479-004-5022-1 · Cited by 800
A Theory of Network Localization
Aspnes, J., Eren, T., Goldenberg, D. K., Morse, A. S., Whiteley, W., Yang, Y. R., Anderson, B. D. O., & Belhumeur, P. N. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.174 · Cited by 635
Metadata
- Authors
- Moré, J. J., & Wu, Z.
- Venue
- SIAM Journal on Optimization
- Published
- 1997-08
- Volume
- 7
- Issue
- 3
- Pages
- 814-836
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2095172966
- Cited by
- 208
- References
- 0
- FWCI
- 4.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Global Continuation for Distance Geometry Problems. https://app.cochat.ai/papers/10.1137/s1052623495283024
- The paper
- Moré, J. J., & Wu, Z. (1997). Global Continuation for Distance Geometry Problems. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623495283024
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.