Reference health
An Overview of Unconstrained Optimization
49/49 checkable references clean · checked 2026-07-26
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
27 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 49 checked references that resolve
resolves10.1137/0326032
Positive Semidefinite Matrices: Characterization via Conical Hulls and Least-Squares Solution of a Matrix Equation
resolves10.1090/S0025-5718-1967-0224273-2
Quasi-Newton methods and their application to function minimisation
resolves10.1137/0726042
A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
resolves10.1090/S0025-5718-1988-0929544-3
Testing a class of methods for solving minimization problems with simple bounds on the variables
resolves10.1007/BF01594934
Convergence of quasi-Newton matrices generated by the symmetric rank one update
resolves10.1090/S0025-5718-1974-0343581-1
A characterization of superlinear convergence and its application to quasi-Newton methods
resolves10.1090/S0025-5718-1970-0258249-6
A family of variable-metric methods derived by variational means
resolves10.1090/S0025-5718-1976-0423804-2
Factorized variable metric methods for unconstrained optimization
resolves10.1007/BF01582091
On the use of directions of negative curvature in a modified newton method
resolves10.1007/BF01582161
How bad are the BFGS and DFP methods when the objective function is quadratic?
resolves10.1090/S0025-5718-1970-0274029-X
Conditioning of quasi-Newton methods for function minimization
resolves10.1145/355921.355933
Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”
resolves10.1007/BFb0120977
Collinear scaling and sequential estimation in sparse optimization algorithms
resolves10.1090/S0025-5718-1977-0455338-4
On sparse and symmetric matrix updating subject to a linear equation
resolves10.1093/imanum/8.4.487
Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
The 27 references without a DOI — listed, not checked
no DOI — not checkedAl-Baali M. (1985) Descent property and global convergence of the Fletcher-Reeves method with inexact line search, J. Inst. Maths. Applns., 5, 121–124
no DOI — not checkedBeale E.M.L. (1972) A derivation of conjugate gradients, in Numerical Methods for Nonlinear Optimization, ed. F.A.Lootsma, Academic Press, London
no DOI — not checkedByrd R.H., Liu D.C. and Nocedal J. (1990) On the behavior of Broyden’s class of quasi-Newton methods, Report NAM-01, Northwestern Univ., Dept. EECS
no DOI — not checkedDennis J.E. and Schnabel R.B. (1983) Numerical Methods for Unconstrained Optimization ana Nonlinear Equations, Prentice-Hall Inc., Englewood Cliffs, NJ
no DOI — not checkedFletcher R. (1987) Practical Methods of Optimization, (2nd. Edition), John Wiley, Chichester
no DOI — not checkedFletcher R. (1990) Low storage methods for unconstrained optimization, in Computational Solution of Nonlinear Systems of Equations, eds. E.L.Allgower and K.Georg, Lectures in Applied Mathematics Vol. 26, AMS Publications, Providence, RI
no DOI — not checkedFletcher R. (1992) An optimal positive definite update for sparse Hessian matrices, Report NA/145, Univ. of Dundee, to appear in SIAM J. Optimization
no DOI — not checkedForsgren A., Gill P.E. and Murray W. (1993) Computing modified Newton directions using a partial Cholesky factorization, Royal Inst, of Tech., Sweden, Dept. of Math. Report TRITA/MAT-93–09
no DOI — not checkedGilbert J.C. and Nocedal J. (1990) Global convergence properties of conjugate gradient methods for optimization, Report 1268, INRIA
no DOI — not checkedGrandinetti (1979) Factorization versus nonfactorization in quasi-Newtonian algorithms for differentiable optimization, in Methods for Operations Research, Hain Verlay
no DOI — not checkedGreenstadt J.L. (1970) Variations of variable metric methods, Maths. of Computation, 24, 1–22
no DOI — not checkedGrippo L., Lampariello F. and Lucidi S. (1990) A quasi-discrete Newton algorithm with a nonmonotone stabilization technique, J. Optim. Theo. Applns., 64, 485–500
no DOI — not checkedHestenes M.R. and Stiefel E. (1952) Methods of conjugate gradients for solving linear systems, J. Res. NBS, 49, 409–436
no DOI — not checkedLalee M. and Nocedal J. (1991) Automatic scaling strategies for quasi-Newton updates, Report NAM-04, Northwestern Univ., Dept. EECS
no DOI — not checkedLefebure B. (1993) Investigating new methods for large scale unconstrained optimization. M.Sc. Thesis, Univ. of Dundee, Dept. of Maths, and CS
no DOI — not checkedLuksan L. (1993) Computational experience with known variable metric updates, Working paper
no DOI — not checkedMoré J.J. (1983) Recent developments in algorithms and software for trust region methods, in Mathematical Programming, The State of the Art, eds. A.Bachem, M Grotschel and G.Korte, Springer-Verlag, Berlin
no DOI — not checkedNash S.C. and Nocedal J. (1989) A numerical study of the limited memory BFGS method and the truncated-Newton method for large scale optimization, Report NAM-02, Northwestern Univ., Dept. EECS
no DOI — not checkedNocedal J. and Yuan Y. (1991) Analysis of a self-scaling quasi-Newton method, Report NAM-02, Northwestern Univ., Dept. EECS
no DOI — not checkedPolak E. and Ribière G. (1969) Note sur la convergence de methodes de directions conjugées, Rev. Française Informat Recherche Opérationnelle, 3e Année, 16, 35–43
no DOI — not checkedPowell M.J.D. (1970) A new algorithm for unconstrained optimization, in Nonlinear Programming, eds. J.B.Rosen, O.L.Mangasarian and K.Ritter, Academic Press, New York
no DOI — not checkedPowell M.J.D. (1976) Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonlinear Programming, SIAM-AMS Proceedings Vol. IX, eds. R.W.Cottle and C. E. Lemke, SIAM Publications, Philadelphia
no DOI — not checkedPowell M.J.D. (1984) Nonconvex minimization calculations and the conjugate gradient method, in Numerical Analysis, Dundee 1983, ed. D.F.Griffiths, Lecture Notes in Mathematics 1066, Springer Verlag, Berlin
no DOI — not checkedSiegel D. (1991) Updating of conjugate direction matrices using members of Broyden’s family, Rep. DAMTP 1991/NA4, Univ. of Cambridge, Dept. AMTP
no DOI — not checkedSiegel D. (1991) Modifying the BFGS update by a new column scaling technique, Report DAMTP 1991/NA5, Univ. of Cambridge, Dept. AMTP
no DOI — not checkedSiegel D. (1992) Implementing and modifying Broyden class updates for large scale optimization, Report DAMTP 1992/NA12, Univ. of Cambridge, Dept. AMTP
no DOI — not checkedToint Ph. L. (1981) Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, ed. I.S.Duff, Academic Press, London
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-26 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1007/978-94-009-0369-2_5"><img src="https://citestamp.com/citestamped/10.1007/978-94-009-0369-2_5/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/978-94-009-0369-2_5)