A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 22 (1), 47-67
- https://doi.org/10.1137/0722003
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- Curvilinear path steplength algorithms for minimization which use directions of negative curvatureMathematical Programming, 1980
- On the use of directions of negative curvature in a modified newton methodMathematical Programming, 1979
- Two new unconstrained optimization algorithms which use function and gradient valuesJournal of Optimization Theory and Applications, 1979
- A Modified Newton’s Method for Unconstrained MinimizationSIAM Journal on Numerical Analysis, 1979
- The Levenberg-Marquardt algorithm: Implementation and theoryPublished by Springer Nature ,1978
- A modification of Armijo's step-size rule for negative curvatureMathematical Programming, 1977
- A modified Newton method for minimizationJournal of Optimization Theory and Applications, 1977
- Quasi-Newton Methods for Unconstrained OptimizationIMA Journal of Applied Mathematics, 1972