Nonmonotone adaptive trust region method with line search based on new diagonal updating

DOI10.1016/j.apnum.2014.12.009zbMath1310.65070OpenAlexW2047822102MaRDI QIDQ2261939

Qunyan Zhou, Dan Hang

Publication date: 13 March 2015

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2014.12.009

zbMATH Keywords

global convergencediagonal updatingnumerical resultnonmonotone techniqueweak secant equationadaptive trust region method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items

A new nonmonotone adaptive trust region algorithm. ⋮ On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ A new nonmonotone adaptive trust region line search method for unconstrained optimization ⋮ An effective adaptive trust region algorithm for nonsmooth minimization

Uses Software

• CUTEr
• SifDec
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmonotone trust region algorithm for unconstrained optimization problems
• A self-adaptive trust region method with line search based on a simple subproblem model
• Nonmonotonic trust region algorithm
• Modified two-point stepsize gradient methods for unconstrained optimization
• A new modified nonmonotone adaptive trust region method for unconstrained optimization
• A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
• Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• An adaptive trust region method and its convergence
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• A Modified BFGS Algorithm for Unconstrained Optimization
• Two-Point Step Size Gradient Methods
• CUTE
• Trust Region Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• The Quasi-Cauchy Relation and Diagonal Updating
• A Nonmonotone Line Search Technique for Newton’s Method
• CUTEr and SifDec
• Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
• Benchmarking optimization software with performance profiles.