Relaxed steepest descent and Cauchy-Barzilai-Borwein method
From MaRDI portal
Publication:5960305
DOI10.1023/A:1013708715892zbMath0988.90049OpenAlexW1530695493MaRDI QIDQ5960305
Marcos Raydan, Benar Fux Svaiter
Publication date: 15 April 2002
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013708715892
Related Items (51)
On initial point selection of the steepest descent algorithm for general quadratic functions ⋮ On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ Gradient methods with adaptive step-sizes ⋮ Squared polynomial extrapolation methods with cycling: an application to the positron emission tomography problem ⋮ Sparse approximations of matrix functions via numerical integration of ODEs ⋮ On the worst case performance of the steepest descent algorithm for quadratic functions ⋮ Steepest descent method with random step lengths ⋮ Runge-Kutta-like scaling techniques for first-order methods in convex optimization ⋮ Cauchy-Schwarz and Kantorovich type inequalities for scalar and matrix moment sequences ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Randomized extrapolation for accelerating EM-type fixed-point algorithms ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems ⋮ Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications ⋮ Fast gradient methods with alignment for symmetric linear systems without using Cauchy step ⋮ Discrete processes and their continuous limits ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ Two modifications of the method of the multiplicative parameters in descent gradient methods ⋮ A gradient descent method for solving a system of nonlinear equations ⋮ Geometric interpretation of some Cauchy related methods ⋮ The chaotic nature of faster gradient descent methods ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ An efficient gradient method using the Yuan steplength ⋮ New stepsizes for the gradient method ⋮ A note on a multiplicative parameters gradient method ⋮ A second-order gradient method for convex minimization ⋮ Memory gradient method with Goldstein line search ⋮ An effective first order reliability method based on Barzilai-Borwein step ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ A new modified Barzilai-Borwein gradient method for the quadratic minimization problem ⋮ Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Nonlocal problem for a general second-order elliptic operator ⋮ On the asymptotic behaviour of some new gradient methods ⋮ A box constrained gradient projection algorithm for compressed sensing ⋮ Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications ⋮ A limited memory steepest descent method ⋮ Gradient descent and fast artificial time integration ⋮ Faster gradient descent and the efficient recovery of images ⋮ New line search methods for unconstrained optimization ⋮ A globally optimal tri-vector method to solve an ill-posed linear system ⋮ On the steepest descent algorithm for quadratic functions ⋮ An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI ⋮ Quadratic extrapolation for accelerating convergence of the EM fixed point problem ⋮ On \(R\)-linear convergence analysis for a class of gradient methods ⋮ A family of spectral gradient methods for optimization ⋮ New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property
This page was built for publication: Relaxed steepest descent and Cauchy-Barzilai-Borwein method
