A Barzilai-Borwein conjugate gradient method
From MaRDI portal
Publication:341313
DOI10.1007/s11425-016-0279-2zbMath1352.49031OpenAlexW2469503150MaRDI QIDQ341313
Publication date: 16 November 2016
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-016-0279-2
global convergenceconjugate gradient methodline searchdescent propertyBarzilai-Bowein gradient methodsubspace minimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization, Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination, A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization, On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems, An extended delayed weighted gradient algorithm for solving strongly convex optimization problems, A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization, 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 hybrid BB-type method for solving large scale unconstrained optimization, A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization, A new subspace minimization conjugate gradient method for unconstrained minimization, An overview of nonlinear optimization, A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization, An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization, A class of accelerated subspace minimization conjugate gradient methods, An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition, New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization, The new spectral conjugate gradient method for large-scale unconstrained optimisation, A subspace minimization conjugate gradient method based on conic model for unconstrained optimization, A family of spectral gradient methods for 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, On the acceleration of the Barzilai-Borwein method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new analysis on the Barzilai-Borwein gradient method
- On the limited memory BFGS method for large scale optimization
- On the asymptotic behaviour of some new gradient methods
- Optimization theory and methods. Nonlinear programming
- An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- A Nonmonotone Line Search Technique for Newton’s Method
- 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 conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A spectral conjugate gradient method for unconstrained optimization
