A Nonmontone Self-adaptive Trust Region Algorithm Based on a Simple Quadratic Model
Duan Fu-jian
Abstract
Duan Fu-jian
Abstract
Based on the simple quadratic model,nonmonotone technique and adaptive technique are combined to propose a nonmonotone self-adaptive trust region algorithm for unconstrained optimization problems.The global and superlinear convergence results of the nonmonotone self-adaptive trust region method are proved under mild conditions.Theoretical analysis shows that the algorithm is efficient and attractive for large-scaled optimization problems.
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.
Based on the simple quadratic model,nonmonotone technique and adaptive technique are combined to propose a nonmonotone self-adaptive trust region algorithm for unconstrained optimization problems.The global and superlinear convergence results of the nonmonotone self-adaptive trust region method are proved under mild conditions.Theoretical analysis shows that the algorithm is efficient and attractive for large-scaled optimization problems.
Key concepts: Trust region, Simple (philosophy), Quadratic equation, Convergence (economics), Quadratic model, Mathematical optimization, Computer science, Quadratic programming