The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A limited-memory algorithm for bound-constrained optimization
Open accessAbstract
An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited-memory BFGS matrix to approximate the Hessian of the objective function. We show how to take advantage of the form of the limited-memory approximation to implement the algorithm efficiently. The results of numerical tests on a set of large problems are reported.
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
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
Self-citationGill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737
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
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
Projected Newton Methods for Optimization Problems with Simple Constraints
Bertsekas, D. P. (1982) · SIAM Journal on Control and Optimization · doi:10.1137/0320018 · Cited by 613
Projected gradient methods for linearly constrained problems
Calamai, P. H., & Moré, J. J. (1987) · Mathematical Programming · doi:10.1007/bf02592073 · Cited by 588
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · SIAM Journal on Numerical Analysis · doi:10.1137/0725029 · Cited by 317
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-12211-2 · Cited by 295
Testing a class of methods for solving minimization problems with simple bounds on the variables
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · Mathematics of Computation · doi:10.1090/s0025-5718-1988-0929544-3 · Cited by 206
Cited by
Joint Optimization of Masks and Deep Recurrent Neural Networks for Monaural Source Separation
Huang, P.-S., Kim, M., Hasegawa-Johnson, M., & Smaragdis, P. (2015) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2015.2468583 · Cited by 461
Optimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
Luo, X.-Z., Liu, J.-G., Zhang, P., & Wang, L. (2020) · Quantum · doi:10.22331/q-2020-10-11-341 · Cited by 157
Metadata
- Authors
- Byrd, R. H., Peihuang, L., & Nocedal, J.
- Published
- 1996-03-01
- OpenAlex
- W2272200996
- Cited by
- 313
- References
- 9
- Type
- report
- Language
- en
- Open access
- green
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 limited-memory algorithm for bound-constrained optimization. https://app.cochat.ai/papers/10.2172/204262
- The paper
- Byrd, R. H., Peihuang, L., & Nocedal, J. (1996). A limited-memory algorithm for bound-constrained optimization. https://doi.org/10.2172/204262
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.