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

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

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
• 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
• Title not available (Why is that?)
• Convex constrained optimization for large-scale generalized Sylvester equations
• Modified nonmonotone Armijo line search for descent method
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• A spectral algorithm for large-scale systems of nonlinear monotone equations
• Impulse noise removal by a nonmonotone adaptive gradient method
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• On the asymptotic behaviour of some new gradient methods
• A class of line search-type methods for nonsmooth convex regularized minimization
• Spectral gradient methods for linearly constrained optimization
• A non-monotonic method for large-scale non-negative least squares
• An efficient gradient method using the Yuan steplength
• New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems
• On the asymptotic convergence and acceleration of gradient methods
• Convergence properties of nonmonotone spectral projected gradient methods
• On \(R\)-linear convergence analysis for a class of gradient methods
• Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• A limited memory steepest descent method
• Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
• An implicit preconditioning strategy for large-scale generalized Sylvester equations
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
• A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
• Step-sizes for the gradient method
• Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
• A new analysis on the Barzilai-Borwein gradient method
• Convergence of descent method without line search
• A multivariate spectral projected gradient method for bound constrained optimization
• A box constrained gradient projection algorithm for compressed sensing
• A new stepsize for the steepest descent method
• Gradient methods with adaptive step-sizes
• Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Alternate step gradient method*
• A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
• Geometric interpretation of some Cauchy related methods
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• Spectral gradient projection method for solving nonlinear monotone equations
• Linear convergence of a type of iterative sequences in nonconvex quadratic programming
• Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems
• Accelerated gradient descent methods with line search
• New inexact line search method for unconstrained optimization
• Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• Convergence analysis for the modified spectral projected subgradient method
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• Modified active set projected spectral gradient method for bound constrained 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)