Correction of trust region method with a new modified Newton method
From MaRDI portal
Publication:5030542
DOI10.1080/00207160.2019.1607844zbMath1483.65099OpenAlexW2938535597MaRDI QIDQ5030542
No author found.
Publication date: 17 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2019.1607844
convergence analysisunconstrained optimizationtrust region methodmodified Newton methodquadrant interlocking factorisation (Q.I.F.)
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 ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems ⋮ Efficient regularized Newton-type algorithm for solving convex optimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A BFGS trust-region method for nonlinear equations
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- A regularized Newton method without line search for unconstrained optimization
- A nonmonotone trust region method for unconstrained optimization
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- A note on the Levenberg-Marquardt parameter
- 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
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- On the global convergence of a parameter-adjusting Levenberg-Marquardt method
- A modified two steps Levenberg-Marquardt method for nonlinear equations
- Optimization theory and methods. Nonlinear programming
- A symmetric linear system solver
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems
- Existence and Stability of Choleski Q.I.F. for Symmetric Linear Systems
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique for Newton’s Method
- The choleski Q.I.F. algorithm for solving symmetric linear systems
- A regularized Newton method for monotone nonlinear equations and its application
