Gradient methods with adaptive step-sizes
From MaRDI portal
Publication:853675
DOI10.1007/S10589-006-6446-0zbMATH Open1121.90099OpenAlexW2004461831MaRDI QIDQ853675FDOQ853675
Authors: N. E. Zubov 
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
Recommendations
Barzilai-Borwein methodlinear systemgradient methodadaptive step-sizesuperlinear behaviortrust-region approach
Cites Work
- Algorithm 813
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Methods of conjugate gradients for solving linear systems
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- A Nonmonotone Line Search Technique for Newton’s Method
- Gradient Method with Retards and Generalizations
- Alternate minimization gradient method
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
- On the Barzilai and Borwein choice of steplength for the gradient method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Inexact spectral projected gradient methods on convex sets
- Alternate step gradient method*
- Title not available (Why is that?)
- Smooth and adaptive gradient method with retards
- Title not available (Why is that?)
- Gradient method with dynamical retards for large-scale optimization problems
- Title not available (Why is that?)
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Title not available (Why is that?)
Cited In (81)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- A stochastic variance reduced gradient method with adaptive step for stochastic optimization
- Direct search conjugate gradient method based on adaptive Barzilai-Borwein step-size
- Cyclic gradient methods for unconstrained optimization
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- New gradient methods with adaptive stepsizes by approximate models
- A low-cost optimization approach for solving minimum norm linear systems and linear least-squares problems
- Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points
- An overview of nonlinear optimization
- Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications
- AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems
- A gradient method exploiting the two dimensional quadratic termination property
- Adaptive step size rules for stochastic optimization in large-scale learning
- A harmonic framework for stepsize selection in gradient methods
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- An effective first order reliability method based on Barzilai-Borwein step
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Impulse noise removal by a nonmonotone adaptive gradient method
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- A cyclic projected gradient method
- Title not available (Why is that?)
- Real-time adaptive optics with pyramid wavefront sensors. II: Accurate wavefront reconstruction using iterative methods
- An efficient gradient method using the Yuan steplength
- On the asymptotic convergence and acceleration of gradient methods
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- Computation of sum of squares polynomials from data points
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- Stochastic gradient descent with Barzilai-Borwein update step for SVM
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
- New adaptive stepsize selections in gradient methods
- New adaptive Barzilai-Borwein step size and its application in solving large-scale optimization problems
- Improved SVRG for finite sum structure optimization with application to binary classification
- Adaptive two-point stepsize gradient algorithm
- On some steplength approaches for proximal algorithms
- Step-sizes for the gradient method
- Variable metric techniques for forward-backward methods in imaging
- Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy
- Gradient methods for large scale convex quadratic functions
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- A delayed weighted gradient method for strictly convex quadratic minimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Alternate step gradient method*
- On the steplength selection in gradient methods for unconstrained optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications
- A simple adaptive step-size choice for iterative optimization methods
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- On the acceleration of the Barzilai-Borwein method
- Iterative regularization algorithms for constrained image deblurring on graphics processors
- A new steplength selection for scaled gradient methods with application to image deblurring
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm
- Delayed gradient methods for symmetric and positive definite linear systems
- An ADMM-based interior-point method for large-scale linear programming
- An adaptive bacterial foraging optimization algorithm with lifecycle and social learning
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies
- Cooperative concurrent asynchronous computation of the solution of symmetric linear systems
- On projected alternating BB methods for variational inequalities
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Accelerated augmented Lagrangian method for total variation minimization
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- On the inexact scaled gradient projection method
- A family of spectral gradient methods for optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
- A new gradient method via least change secant update
- Two-point step size gradient method for solving a deep learning problem
- Complete vehicle energy management using adaptive primal-dual operator splitting
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- Benchmarking large-scale distributed convex quadratic programming algorithms
- Ritz-like values in steplength selections for stochastic gradient methods
- Gradient methods exploiting spectral properties
- Inexact Bregman iteration for deconvolution of superimposed extended and point sources
Uses Software
This page was built for publication: Gradient methods with adaptive step-sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853675)
