A New Nonmonotone Adaptive Trust Region Method for Unconstrained Optimization Problems
Qunyan Zhou
Abstract
Qunyan Zhou
Abstract
In this paper,a new nonmonotone adaptive trust region method for unconstrained optimization problems is presented.The trust region radius in the new method is determined with the scalar approximation of Hessian matrix of the objective function.Under general conditions,the global and superlinear convergence results of the algorithm are established.Numerical results show that the new method is more efficient.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,a new nonmonotone adaptive trust region method for unconstrained optimization problems is presented.The trust region radius in the new method is determined with the scalar approximation of Hessian matrix of the objective function.Under general conditions,the global and superlinear convergence results of the algorithm are established.Numerical results show that the new method is more efficient.
Key concepts: Trust region, Hessian matrix, Mathematical optimization, Convergence (economics), Mathematics, Scalar (mathematics), Optimization problem, Computer science