Gradient methods with adaptive step-sizes
From MaRDI portal
Publication:853675
DOI10.1007/s10589-006-6446-0zbMath1121.90099OpenAlexW2004461831MaRDI QIDQ853675
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-6446-0
linear systemadaptive step-sizegradient methodBarzilai-Borwein methodsuperlinear behaviortrust-region approach
Related Items (62)
Geometrical inverse matrix approximation for least-squares problems and acceleration strategies ⋮ An accelerated minimal gradient method with momentum for strictly convex quadratic optimization ⋮ Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules ⋮ On some steplength approaches for proximal algorithms ⋮ Ritz-like values in steplength selections for stochastic gradient methods ⋮ Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming ⋮ A new adaptive Barzilai and Borwein method for unconstrained optimization ⋮ An extended delayed weighted gradient algorithm for solving strongly convex optimization problems ⋮ Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization ⋮ Cooperative concurrent asynchronous computation of the solution of symmetric linear systems ⋮ An adaptive bacterial foraging optimization algorithm with lifecycle and social learning ⋮ Benchmarking large-scale distributed convex quadratic programming algorithms ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization ⋮ Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ A gradient method exploiting the two dimensional quadratic termination property ⋮ A new steplength selection for scaled gradient methods with application to image deblurring ⋮ A comparison of edge-preserving approaches for differential interference contrast microscopy ⋮ Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds ⋮ Fast gradient methods with alignment for symmetric linear systems without using Cauchy step ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ Computation of Sum of Squares Polynomials from Data Points ⋮ An overview of nonlinear optimization ⋮ Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy ⋮ A cyclic projected gradient method ⋮ A harmonic framework for stepsize selection in gradient methods ⋮ Impulse noise removal by a nonmonotone adaptive gradient method ⋮ Iterative regularization algorithms for constrained image deblurring on graphics processors ⋮ Real-time adaptive optics with pyramid wavefront sensors: part II. Accurate wavefront reconstruction using iterative methods ⋮ Gradient methods exploiting spectral properties ⋮ Variable metric techniques for forward-backward methods in imaging ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ An efficient gradient method using the Yuan steplength ⋮ An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem ⋮ IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS ⋮ An effective first order reliability method based on Barzilai-Borwein step ⋮ Improved SVRG for finite sum structure optimization with application to binary classification ⋮ Stochastic gradient descent with Barzilai-Borwein update step for SVM ⋮ An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs ⋮ An accelerated active-set algorithm for a quadratic semidefinite program with general constraints ⋮ A delayed weighted gradient method for strictly convex quadratic minimization ⋮ Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm ⋮ Inexact Bregman iteration for deconvolution of superimposed extended and point sources ⋮ Barzilai-Borwein-like methods for the extreme eigenvalue problem ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ On the asymptotic convergence and acceleration of gradient methods ⋮ Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications ⋮ On projected alternating BB methods for variational inequalities ⋮ On the inexact scaled gradient projection method ⋮ Accelerated augmented Lagrangian method for total variation minimization ⋮ A family of spectral gradient methods for optimization ⋮ Complete vehicle energy management using adaptive primal-dual operator splitting ⋮ An ADMM-based interior-point method for large-scale linear programming ⋮ NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property ⋮ Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems ⋮ Scaling techniques for gradient projection-type methods in astronomical image deblurring ⋮ Hybrid limited memory gradient projection methods for box-constrained optimization problems ⋮ On the acceleration of the Barzilai-Borwein method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Smooth and adaptive gradient method with retards
- Gradient method with dynamical retards for large-scale optimization problems
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Gradient Method with Retards and Generalizations
- Alternate minimization gradient method
- Inexact spectral projected gradient methods on convex sets
- Alternate step gradient method*
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- A Nonmonotone Line Search Technique for Newton’s Method
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
- Methods of conjugate gradients for solving linear systems
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
This page was built for publication: Gradient methods with adaptive step-sizes
