An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
From MaRDI portal
Publication:1730776
DOI10.1007/s10957-018-1393-3zbMath1409.49031OpenAlexW2892724185WikidataQ129182962 ScholiaQ129182962MaRDI QIDQ1730776
Publication date: 6 March 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1393-3
unconstrained optimizationsubspace minimization\(R\)-linear convergenceBarzilai-Borwein conjugate gradient methodnon-monotone Wolfe line search
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (16)
A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization ⋮ An extended delayed weighted gradient algorithm for solving strongly convex optimization problems ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ A modified four-term extension of the Dai-Liao conjugate gradient method ⋮ A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization ⋮ A new subspace minimization conjugate gradient method for unconstrained minimization ⋮ A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization ⋮ A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice ⋮ A class of accelerated subspace minimization conjugate gradient methods ⋮ A conjugate gradient method for distributed optimal control problems with nonhomogeneous Helmholtz equation ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ Two modified DY conjugate gradient methods for unconstrained optimization problems ⋮ A modified spectral conjugate gradient method with global convergence ⋮ A subspace minimization conjugate gradient method based on conic model for unconstrained optimization ⋮ A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Barzilai-Borwein conjugate gradient method
- Scaling on the spectral gradient method
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Gradient methods with adaptive step-sizes
- Modified two-point stepsize gradient methods for unconstrained optimization
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Modified BFGS Algorithm for Unconstrained Optimization
- Algorithm 851
- Two-Point Step Size Gradient Methods
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- On the Barzilai and Borwein choice of steplength for the gradient method
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- The Limited Memory Conjugate Gradient Method
- CUTEr and SifDec
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
