Two nonmonotone trust region algorithms based on an improved Newton method
From MaRDI portal
Publication:2053070
Recommendations
- A new nonmonotone trust region algorithm
- An improved nonmonotonic trust region algorithm
- A nonmonotone trust region method based on simple quadratic models
- A new nonmonotonic trust region algorithm with nonmonotonic line search
- Nonmonotone trust region algorithm for unconstrained optimization problems
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new modified trust region algorithm for solving unconstrained optimization problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A note on the Levenberg-Marquardt parameter
- A regularization Newton method for solving nonlinear complementarity problems
- A regularized Newton method for degenerate unconstrained optimization problems
- A symmetric linear system solver
- A two-step improved Newton method to solve convex unconstrained optimization problems
- An efficient improvement of the Newton method for solving nonconvex optimization problems
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Communication analysis of the PIE and QIF algorithms on distributed memory architecture
- 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
- CUTEr and SifDec
- Existence and Stability of Choleski Q.I.F. for Symmetric Linear Systems
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Regularized Newton methods for convex minimization problems with singular solutions
- Testing Unconstrained Optimization Software
- The choleski Q.I.F. algorithm for solving symmetric linear systems
- Trust region dogleg path algorithms for unconstrained minimization
Cited in
(3)- A model trust-region modification of Newton's method for nonlinear two- point boundary-value problems
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
This page was built for publication: Two nonmonotone trust region algorithms based on an improved Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053070)
