On the Barzilai and Borwein choice of steplength for the gradient method
From MaRDI portal
Publication:5287664
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
Cited in
(only showing first 100 items - show all)- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- A descent algorithm without line search for unconstrained optimization
- Sizing the BFGS and DFP updates: Numerical study
- Maxentropic analysis of linear programming problems
- Linear reconstruction problems with convex constraints: Influence of the a priori data
- A comparative study of some reconstruction methods for linear inverse problems.
- A residual algorithm for finding a fixed point of a nonexpansive mapping
- 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 joint matrix minimization approach for multi-image face recognition
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
- Nonsmooth spectral gradient methods for unconstrained optimization
- A spectral algorithm for large-scale systems of nonlinear monotone equations
- A unified formulation for generalized oilfield development optimization
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- Stochastic gradient descent with Barzilai-Borwein update step for SVM
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- Minimization subproblems and heuristics for an applied clustering problem
- A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
- Impulse noise removal by a nonmonotone adaptive gradient method
- Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization
- 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
- Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications
- Analysis of continuous \(H^{-1}\)-least-squares methods for the steady Navier-Stokes system
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- Spectral residual method for nonlinear equations on Riemannian manifolds
- On the asymptotic convergence and acceleration of gradient methods
- On \(R\)-linear convergence analysis for a class of gradient methods
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations
- A class of line search-type methods for nonsmooth convex regularized minimization
- On the acceleration of the Barzilai-Borwein method
- Diagonal BFGS updates and applications to the limited memory BFGS method
- An extended projected residual algorithm for solving smooth convex optimization problems
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- Ritz-like values in steplength selections for stochastic gradient methods
- Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces
- Two-point step size gradient method for solving a deep learning problem
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- A family of modified spectral projection methods for nonlinear monotone equations with convex constraint
- A survey of gradient methods for solving nonlinear optimization
- A new projected Barzilai-Borwein method for the symmetric cone complementarity problem
- Improved SVRG for finite sum structure optimization with application to binary classification
- A new spectral method for \(l_1\)-regularized minimization
- Exact spectral-like gradient method for distributed optimization
- A delayed weighted gradient method for strictly convex quadratic minimization
- Accelerated augmented Lagrangian method for total variation minimization
- A family of spectral gradient methods for optimization
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- A flexible inexact-restoration method for constrained optimization
- Convergence analysis for the modified spectral projected subgradient method
- Novel algorithms for noisy minimization problems with applications to neural networks training
- Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems
- Runge-Kutta-like scaling techniques for first-order methods in convex optimization
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- Structured two-point stepsize gradient methods for nonlinear least squares
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- On the steplength selection in gradient methods for unconstrained optimization
- Convergence of supermemory gradient method
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Memory gradient method with Goldstein line search
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- On the asymptotic behaviour of some new gradient methods
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Spectral gradient projection method for solving nonlinear monotone equations
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems
- Spectral gradient methods for linearly constrained optimization
- Convergence of descent method without line search
- Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains
- A harmonic framework for stepsize selection in gradient methods
- Optimization-based shrinking dimer method for finding transition states
- A projected gradient method for optimization over density matrices
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- A non-monotonic method for large-scale non-negative least squares
- A modified two-point stepsize gradient algorithm for unconstrained minimization
- On the symmetric quadratic eigenvalue complementarity problem
- Projected gradient algorithms for optimization over order simplices
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- A new gradient method via least change secant update
- On some curvature-dependent steplength for the gradient method
- Projected Barzilai-Borwein method for large-scale nonnegative image restoration
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- New adaptive Barzilai-Borwein step size and its application in solving large-scale optimization problems
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- A Barzilai-Borwein conjugate gradient method
- A new nonmonotone spectral residual method for nonsmooth nonlinear equations
- Convergence properties of inexact projected gradient methods
- On the rate of convergence of projected Barzilai-Borwein methods
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
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)
