A hybrid BB-type method for solving large scale unconstrained optimization
From MaRDI portal
Publication:6138335
DOI10.1007/s12190-022-01826-8zbMath1518.90105MaRDI QIDQ6138335
Publication date: 5 September 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Barzilai-Borwein conjugate gradient method
- Scaling on the spectral gradient method
- A hybrid trust region algorithm for unconstrained optimization
- A differential equation method for solving box constrained variational inequality problems
- Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
- A modified BFGS algorithm based on a hybrid secant equation
- Hybrid spectral gradient method for the unconstrained minimization problem
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- New quasi-Newton equation and related methods for unconstrained optimization
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Neurodynamical optimization
- Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization
- Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- A family of spectral gradient methods for optimization
- Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
- On the steplength selection in gradient methods for unconstrained optimization
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- An ODE-based nonmonotone method for unconstrained optimization problems
- A new method for solving split equality problems via projection dynamical systems
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Optimization Methods for Large-Scale Machine Learning
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Trust Region Algorithms and Timestep Selection
- A Nonmonotone Line Search Technique for Newton’s Method
- An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- CUTEr and SifDec
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A hybrid BB-type method for solving large scale unconstrained optimization