On the Barzilai and Borwein choice of steplength for the gradient method

DOI10.1093/IMANUM/13.3.321zbMATH Open0778.65045OpenAlexW2050096287MaRDI QIDQ5287664FDOQ5287664

Authors: M. Raydan 

Publication date: 17 August 1993

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/101676

Recommendations

• Publication:3200898
• On the steplength selection in gradient methods for unconstrained optimization
• On the steplength selection in stochastic gradient methods
• A new analysis on the Barzilai-Borwein gradient method
• \(R\)-linear convergence of the Barzilai and Borwein gradient method
• Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization
• A new gradient method with an optimal stepsize property
• Ritz-like values in steplength selections for stochastic gradient methods
• Two novel gradient methods with optimal step sizes
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem

zbMATH Keywords

convergencegradient methodstrictly convex quadratic functionchoice of steplength

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25)

Cited In (only showing first 100 items - show all)

• Maxentropic analysis of linear programming problems
• A comparative study of some reconstruction methods for linear inverse problems.
• A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
• A computation study on an integrated alternating direction method of multipliers for large scale optimization
• Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods
• Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
• An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
• A family of quasi-Newton methods for unconstrained optimization problems
• Hybrid spectral gradient method for the unconstrained minimization problem
• A residual algorithm for finding a fixed point of a nonexpansive mapping
• Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
• Residual methods for the large-scale matrix \(p\)th root and some related problems
• A new spectral method for \(l_1\)-regularized minimization
• Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
• Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
• Stochastic gradient descent with Barzilai-Borwein update step for SVM
• Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization
• Minimization subproblems and heuristics for an applied clustering problem
• On some curvature-dependent steplength for the gradient method
• Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
• Title not available (Why is that?)
• Accelerated multiple step-size methods for solving unconstrained optimization problems
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
• A new adaptive Barzilai and Borwein method for unconstrained optimization
• Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
• A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
• A joint matrix minimization approach for multi-image face recognition
• Convergence of supermemory gradient method
• Diagonal BFGS updates and applications to the limited memory BFGS method
• On the acceleration of the Barzilai-Borwein method
• A modified two-point stepsize gradient algorithm for unconstrained minimization
• NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS
• Nonsmooth spectral gradient methods for unconstrained optimization
• A descent algorithm without line search for unconstrained optimization
• Some projection methods with the BB step sizes for variational inequalities
• An accelerated double step size model in unconstrained optimization
• Sizing the BFGS and DFP updates: Numerical study
• Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
• An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
• Accelerated augmented Lagrangian method for total variation minimization
• Structured two-point stepsize gradient methods for nonlinear least squares
• A family of spectral gradient methods for optimization
• A Newton Frank-Wolfe method for constrained self-concordant minimization
• A unified formulation for generalized oilfield development optimization
• A new gradient method via least change secant update
• A family of modified spectral projection methods for nonlinear monotone equations with convex constraint
• Linear reconstruction problems with convex constraints: Influence of the a priori data
• Convergence of descent method with new line search
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
• Stabilized BB projection algorithm for large-scale convex constrained nonlinear monotone equations to signal and image processing problems
• Extension of the Barzilai–Borwein Method for Quadratic Forms in Finite Euclidean Spaces
• The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
• Nonlocal problem for a general second-order elliptic operator
• Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
• A new projected Barzilai-Borwein method for the symmetric cone complementarity problem
• Title not available (Why is that?)
• A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization
• A modified Barzilai-Borwein algorithm for the generalized absolute value equation
• Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications
• Projected gradient algorithms for optimization over order simplices
• Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property
• Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
• A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization
• A stabilized simulated annealing based Barzilai-Borwein method for the solution of unconstrained optimization problems
• Improved SVRG for finite sum structure optimization with application to binary classification
• A homogeneous Rayleigh quotient with applications in gradient methods
• Memory gradient method with Goldstein line search
• Analysis of continuous \(H^{-1}\)-least-squares methods for the steady Navier-Stokes system
• Cyclic gradient methods for unconstrained optimization
• Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
• An extended projected residual algorithm for solving smooth convex optimization problems
• A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
• Convergence of memory gradient methods
• New gradient methods with adaptive stepsizes by approximate models
• Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces
• A low-cost optimization approach for solving minimum norm linear systems and linear least-squares problems
• A delayed weighted gradient method for strictly convex quadratic minimization
• Novel algorithms for noisy minimization problems with applications to neural networks training
• Spectral residual method for nonlinear equations on Riemannian manifolds
• On the rate of convergence of projected Barzilai–Borwein methods
• An overview of nonlinear optimization
• Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications
• Optimization-based shrinking dimer method for finding transition states
• Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains
• A hybrid direct search and projected simplex gradient method for convex constrained minimization
• On projected alternating BB methods for variational inequalities
• Runge-Kutta-like scaling techniques for first-order methods in convex optimization
• Reconstruction of Voronoi diagrams in inverse potential problems
• Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
• A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems
• On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems
• CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
• A gradient method exploiting the two dimensional quadratic termination property
• Two-point step size gradient method for solving a deep learning problem
• Several kinds of acceleration techniques for unconstrained optimization first-order algorithms
• A survey of gradient methods for solving nonlinear optimization

This page was built for publication: On the Barzilai and Borwein choice of steplength for the gradient method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287664)