Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables.

Coleman, Thomas F., Li, Yuying · 1996 · SIAM Journal on Optimization

Abstract

We propose a new algorithm, a reflective Newton method, for the minimization of a quadratic function of many variables subject to upper arid lower bounds on some of the variables. The method applies to a general (indefinite) quadratic function for which a local minimizes subject to bounds is required and is particularly suitable for the large-scale problem. Our new method exhibits strong convergence properties and global and second-order convergence and appears to have significant practical potential. Strictly feasible points are generated. We provide experimental results on moderately large and sparse problems based on both sparse Cholesky and preconditioned conjugate gradient linear solvers.

Overview

Integrity signals

Registry

Crossref · 10.1137/s1052623494240456

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 21 references

Research works printed but not linked: 6

  1. Coleman Thomas F., 1990, Large-scale numerical optimization (Ithaca, NY, 1989), 49
  2. Han Chi-Geun, 1990, Large-scale numerical optimization (Ithaca, NY, 1989), 92
  3. Júdice J. J., 1989, Investigacao Peracional, 9, 23
  4. Lotstedt P., 1984, BIT, 24, 206
  5. Moler C. B., 1987, ProMatlab User's Guide
  6. U. Öreborn, Ph.D. Thesis, A direct method for sparse nonnegative least squares problems, Department of Mathematics, Linköping University, Linköping, Sweden, 1986

Cited by

See all 611

Metadata

Authors
Coleman, T. F., & Li, Y.
Venue
SIAM Journal on Optimization
Published
1996-11
Volume
6
Issue
4
Pages
1040-1058
ISSN
  • 1052-6234 (ISSN-L)
  • 1095-7189
OpenAlex
W1970185852
Cited by
604
References
21
Citations by year
2026: 13 · 2025: 21 · 2024: 12 · 2023: 21 · 2022: 25 · 2021: 28 · 2020: 26 · 2019: 32 · 2018: 36 · 2017: 28 · 2016: 33 · 2015: 28 · 2014: 33 · 2013: 34 · 2012: 34
FWCI
1.79
Type
journal article
Language
en
Open access
closed
Locations
  • SIAM Journal on Optimization (publishedVersion)
  • eCommons (Cornell University) (submittedVersion)
Topics
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
Keywords
quadratic programming, bound-constrained optimization, large-scale optimization, global convergence, second-order convergence, sparse Cholesky factorization, preconditioned conjugate gradient

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 reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. https://app.cochat.ai/papers/10.1137/s1052623494240456
The paper
Coleman, T. F., & Li, Y. (1996). A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623494240456

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.