Keywords
MathematicsNewton's methodFunction (biology)Quasi-Newton methodMathematical optimizationNewton's method in optimizationNewton fractalAlgorithmApplied mathematicsNumerical analysisMathematical analysisLocal convergenceIterative methodNonlinear system
Affiliated Institutions
Related Publications
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Preface 1. Introduction. Problems to be considered Characteristics of 'real-world' problems Finite-precision arithmetic and measurement of error Exercises 2. Nonlinear Problems ...
Preconditioning of Truncated-Newton Methods
In this paper we discuss the use of truncated-Newton methods, a flexible class of iterative methods, in the solution of large-scale unconstrained minimization problems. At each ...
A globally convergent primal-dual interior point method for constrained optimization
Abstract This paper proposes a primal-dual interior point method for solving general nonlinearly constrained optimization problems. The method is based on solving the Barrier Ka...
Updating quasi-Newton matrices with limited storage
We study how to use the BFGS quasi-Newton matrices to precondition minimization methods for problems where the storage is critical. We give an update formula which generates mat...
A Rapidly Convergent Descent Method for Minimization
A powerful iterative descent method for finding a local minimum of a function of several variables is described. A number of theorems are proved to show that it always converges...
Publication Info
- Year
- 1982
- Type
- article
- Volume
- 23
- Issue
- 1
- Pages
- 20-33
- Citations
- 65
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
65
OpenAlex
2
Influential
54
CrossRef
Cite This
Dianne P. O’Leary
(1982).
A discrete Newton algorithm for minimizing a function of many variables.
Mathematical Programming
, 23
(1)
, 20-33.
https://doi.org/10.1007/bf01583777
Identifiers
- DOI
- 10.1007/bf01583777