A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems
From MaRDI portal
Publication:2025210
DOI10.1007/s10255-021-0997-9zbMath1468.90095OpenAlexW3120084849MaRDI QIDQ2025210
Xing Li, Zheng Peng, Wen-Li Dong
Publication date: 11 May 2021
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-021-0997-9
global convergencetrust region methodBarzilai-Borwein methodnonmonotone techniquemetropolis criterion
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)
Cites Work
- Unnamed Item
- Two-step modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- An efficient gradient method using the Yuan steplength
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
- A nonmonotone trust region method for unconstrained optimization
- Nonmonotonic trust region algorithm
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Accelerated Line-search and Trust-region Methods
- Two-Point Step Size Gradient Methods
- Alternate minimization gradient method
- Alternate step gradient method*
- A Nonmonotone Line Search Technique for Newton’s Method
- Equation of State Calculations by Fast Computing Machines
- A New Algorithm for Unconstrained Optimization
This page was built for publication: A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems