On the Barzilai and Borwein choice of steplength for the gradient method
From MaRDI portal
Publication:5287664
DOI10.1093/imanum/13.3.321zbMath0778.65045OpenAlexW2050096287MaRDI QIDQ5287664
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
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)
Related Items
A residual algorithm for finding a fixed point of a nonexpansive mapping, Hybrid spectral gradient method for the unconstrained minimization problem, Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions, An extended projected residual algorithm for solving smooth convex optimization problems, A Newton Frank-Wolfe method for constrained self-concordant minimization, 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, New inexact line search method for unconstrained optimization, Gradient methods with adaptive step-sizes, 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, A Barzilai-Borwein conjugate gradient method, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, A new nonmonotone spectral residual method for nonsmooth nonlinear equations, Monotone projected gradient methods for large-scale box-constrained quadratic programming, A joint matrix minimization approach for multi-image face recognition, A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems, Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Maxentropic analysis of linear programming problems, Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations, Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces, Nonsmooth spectral gradient methods for unconstrained optimization, A spectral algorithm for large-scale systems of nonlinear monotone equations, Two-point step size gradient method for solving a deep learning 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, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, A multivariate spectral projected gradient method for bound constrained optimization, A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization, An accelerated double step size model in unconstrained optimization, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, A unified formulation for generalized oilfield development optimization, Modified active set projected spectral gradient method for bound constrained optimization, Impulse noise removal by a nonmonotone adaptive gradient method, Geometric interpretation of some Cauchy related methods, A family of modified spectral projection methods for nonlinear monotone equations with convex constraint, A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares, A new analysis on the Barzilai-Borwein gradient method, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, A survey of gradient methods for solving nonlinear optimization, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, Scalar correction method for solving large scale unconstrained minimization problems, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization, A new projected Barzilai-Borwein method for the symmetric cone complementarity problem, An efficient gradient method using the Yuan steplength, Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems, FR type methods for systems of large-scale nonlinear monotone equations, Solving bound constrained optimization via a new nonmonotone spectral projected gradient method, Multivariate spectral gradient method for unconstrained optimization, A new modified Barzilai-Borwein gradient method for the quadratic minimization problem, Improved SVRG for finite sum structure optimization with application to binary classification, A computation study on an integrated alternating direction method of multipliers for large scale optimization, An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization, 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, Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods, A new spectral method for \(l_1\)-regularized minimization, A Kronecker approximation with a convex constrained optimization method for blind image restoration, Modified nonmonotone Armijo line search for descent method, Convex constrained optimization for large-scale generalized Sylvester equations, Nonlocal problem for a general second-order elliptic operator, An implicit preconditioning strategy for large-scale generalized Sylvester equations, A box constrained gradient projection algorithm for compressed sensing, 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, Convergence properties of nonmonotone spectral projected gradient methods, Nonmonotone strategy for minimization of quadratics with simple constraints., Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications, Residual methods for the large-scale matrix \(p\)th root and some related problems, Analysis of continuous \(H^{-1}\)-least-squares methods for the steady Navier-Stokes system, A limited memory steepest descent method, A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models, On nonmonotone Chambolle gradient projection algorithms for total variation image restoration, Exact spectral-like gradient method for distributed optimization, A delayed weighted gradient method for strictly convex quadratic minimization, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Spectral residual method for nonlinear equations on Riemannian manifolds, On the asymptotic convergence and acceleration of gradient methods, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Some projection methods with the BB step sizes for variational inequalities, On \(R\)-linear convergence analysis for a class of gradient methods, Linear reconstruction problems with convex constraints: Influence of the a priori data, Accelerated augmented Lagrangian method for total variation minimization, A family of spectral gradient methods for optimization, A descent algorithm without line search for unconstrained optimization, Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems, 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, A comparative study of some reconstruction methods for linear inverse problems., A flexible inexact-restoration method for constrained optimization, Sizing the BFGS and DFP updates: Numerical study, On the acceleration of the Barzilai-Borwein method, Diagonal BFGS updates and applications to the limited memory BFGS method, Minimization subproblems and heuristics for an applied clustering problem, Convergence analysis for the modified spectral projected subgradient method, Convergence of descent method with new line search, Novel algorithms for noisy minimization problems with applications to neural networks training, Convergence properties of inexact projected gradient methods, On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems, On the rate of convergence of projected Barzilai–Borwein methods, A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems, Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems, On the symmetric quadratic eigenvalue complementarity problem, Projected gradient algorithms for optimization over order simplices, Runge-Kutta-like scaling techniques for first-order methods in convex optimization, Unnamed Item, Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization, Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Unnamed Item, A homogeneous Rayleigh quotient with applications in gradient methods, Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation, 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, Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications, A gradient method exploiting the two dimensional quadratic termination property, Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes, Sensitivity analysis and tailored design of minimization diagrams, A modified Barzilai-Borwein algorithm for the generalized absolute value equation, An overview of nonlinear optimization, Convergence of memory gradient methods, Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations, A harmonic framework for stepsize selection in gradient methods, Real-time adaptive optics with pyramid wavefront sensors: part II. Accurate wavefront reconstruction using iterative methods, Gradient methods exploiting spectral properties, A new gradient method via least change secant update, Convergence of supermemory gradient method, A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization, An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Memory gradient method with Goldstein line search, CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD, A family of quasi-Newton methods for unconstrained optimization problems, Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, An alternating direction method for linear‐constrained matrix nuclear norm minimization, On the asymptotic behaviour of some new gradient methods, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems, Spectral gradient projection method for solving nonlinear monotone equations, Optimization-based Shrinking Dimer Method for Finding Transition States, Minimization algorithms based on supervisor and searcher cooperation, Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem, Projected Barzilai–Borwein method for large-scale nonnegative image restoration, Accelerated gradient descent methods with line search, Projected gradient methods for synchrotron radiation spectra distribution function reconstruction, Barzilai-Borwein-like methods for the extreme eigenvalue problem, An alternating direction method for solving a class of inverse semi-definite quadratic programming problems, Extension of the Barzilai–Borwein Method for Quadratic Forms in Finite Euclidean Spaces, A projected gradient method for optimization over density matrices, Spectral residual method without gradient information for solving large-scale nonlinear systems of equations, Unnamed Item, Alternate step gradient method*, On projected alternating BB methods for variational inequalities, Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods, 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, NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS, Convergence of descent method without line search, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, 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, Accelerated multiple step-size methods for solving unconstrained optimization problems
