The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
Abstract
A subspace adaptation of the Coleman--Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the convergence properties of this subspace trust region method are as strong as those of its full-space version. Computational performance on various large test problems is reported; advantages of our approach are demonstrated. Our experience indicates that our proposed method represents an efficient way to solve large bound-constrained minimization problems.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/0806023 · Cited by 3,320
Self-citationTesting Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,527
Moré, J. J., & Sorensen, D. C. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904038 · Cited by 1,411
Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Vol. I: Theory
Cullum, J. K., & Willoughby, R. A. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719192 · Cited by 1,291
Coleman, T. F., & Li, Y. (1994) · Mathematical Programming · doi:10.1007/bf01582221 · Cited by 1,135
Self-citationThe Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
Bongartz, I., Conn, A. R., Gould, N. I. M., & Toint, P. L. (1995) · ACM Transactions on Mathematical Software · doi:10.1145/200979.201043 · Cited by 784
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/s1052623494240456 · Cited by 604
Self-citationColeman, T. F., & Li, Y. (1992) · Cited by 551
Self-citation
Cited by
Anipose: A toolkit for robust markerless 3D pose estimation
Karashchuk, P., Rupp, K. L., Dickinson, E. S., Walling-Bell, S., Sanders, E., Azim, E., Brunton, B. W., & Tuthill, J. C. (2021) · Cell Reports · doi:10.1016/j.celrep.2021.109730 · Cited by 324
Metadata
- Authors
- Branch, M. A., Coleman, T. F., & Li, Y.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1999-01
- Volume
- 21
- Issue
- 1
- Pages
- 1-23
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2005660297
- Cited by
- 1,083
- References
- 13
- FWCI
- 4.63
- 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: A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems. https://app.cochat.ai/papers/10.1137/s1064827595289108
- The paper
- Branch, M. A., Coleman, T. F., & Li, Y. (1999). A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827595289108
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.
