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.
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Since is a covariance matrix, and it is therefore strictly positive definite, this is a strictly convex quadratic programming problem that can be easily solved using standard algorithms, such as reflective Newton methods [33] and active set methods [34].”
From Parameter estimation and model selection in computational biology (2010) · cites this paper as [33]
Citations
Cites
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
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
Sparse Matrices in MATLAB: Design and Implementation
Gilbert, J. R., Moler, C., & Schreiber, R. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613024 · Cited by 591
Approximate solution of the trust region problem by minimization over two-dimensional subspaces
Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1988) · Mathematical Programming · doi:10.1007/bf01580735 · Cited by 411
On the Solution of Large Quadratic Programming Problems with Bound Constraints
Moré, J. J., & Toraldo, G. (1991) · SIAM Journal on Optimization · doi:10.1137/0801008 · Cited by 335
Algorithms for bound constrained quadratic programming problems
Mor�, J. J., & Toraldo, G. (1989) · Numerische Mathematik · doi:10.1007/bf01396045 · Cited by 230
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
A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
O’Leary, D. P. (1980) · Linear Algebra and its Applications · doi:10.1016/0024-3795(80)90173-1 · Cited by 89
Research works printed but not linked: 6
- Coleman Thomas F., 1990, Large-scale numerical optimization (Ithaca, NY, 1989), 49
- Han Chi-Geun, 1990, Large-scale numerical optimization (Ithaca, NY, 1989), 92
- Júdice J. J., 1989, Investigacao Peracional, 9, 23
- Lotstedt P., 1984, BIT, 24, 206
- Moler C. B., 1987, ProMatlab User's Guide
- 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
Accurate secondary structure prediction and fold recognition for circular dichroism spectroscopy
Micsonai, A., Wien, F., Kernya, L., Lee, Y.-H., Goto, Y., Réfrégiers, M., & Kardos, J. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1500851112 · Cited by 1,703
Amor, H., Marigo, J.-J., & Maurini, C. (2009) · Journal of the Mechanics and Physics of Solids · doi:10.1016/j.jmps.2009.04.011 · Cited by 1,662
Coleman, T. F., & Li, Y. (1994) · Mathematical Programming · doi:10.1007/bf01582221 · Cited by 1,135
Self-citationBranch, M. A., Coleman, T. F., & Li, Y. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595289108 · Cited by 1,083
Self-citationInformation diffusion in online social networks: a survey
Guille, A., Hacid, H., Favre, C., & Zighed, D. A. (2013) · ACM SIGMOD Record · doi:10.1145/2503792.2503797 · Cited by 851
Metadata
- Authors
- Coleman, T. F., & Li, Y.
- ORCID
- Li, Yuying
- 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.