Two nonmonotone trust region algorithms based on an improved Newton method

DOI10.1007/s12190-020-01350-7zbMath1475.65041OpenAlexW3018870315MaRDI QIDQ2053070

Yanyan Li

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01350-7

zbMATH Keywords

convergence analysistrust region methodmodified Newton methodnonmonotone Armijo-type line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search

Uses Software

• CUTEr
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
• Convergence rate of the trust region method for nonlinear equations under local error bound condition
• A note on the Levenberg-Marquardt parameter
• Trust region dogleg path algorithms for unconstrained minimization
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• A regularization Newton method for solving nonlinear complementarity problems
• Regularized Newton methods for convex minimization problems with singular solutions
• A regularized Newton method for degenerate unconstrained optimization problems
• A two-step improved Newton method to solve convex unconstrained optimization problems
• Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
• A symmetric linear system solver
• Existence and Stability of Choleski Q.I.F. for Symmetric Linear Systems
• Testing Unconstrained Optimization Software
• Communication analysis of the PIE and QIF algorithms on distributed memory architecture
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• The choleski Q.I.F. algorithm for solving symmetric linear systems
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• CUTEr and SifDec
• Benchmarking optimization software with performance profiles.