Gradient methods with adaptive step-sizes
From MaRDI portal
Publication:853675
Recommendations
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Algorithm 813
- Alternate minimization gradient method
- Alternate step gradient method*
- Gradient method with dynamical retards for large-scale optimization problems
- Gradient Method with Retards and Generalizations
- scientific article; zbMATH DE number 2186558 (Why is no real title available?)
- scientific article; zbMATH DE number 4147424 (Why is no real title available?)
- scientific article; zbMATH DE number 2110305 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- Inexact spectral projected gradient methods on convex sets
- Methods of conjugate gradients for solving linear systems
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the Barzilai and Borwein choice of steplength for the gradient method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Smooth and adaptive gradient method with retards
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(97)- New adaptive stepsize selections in gradient methods
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Stochastic gradient descent with Barzilai-Borwein update step for SVM
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm
- An adaptive bacterial foraging optimization algorithm with lifecycle and social learning
- A cyclic projected gradient method
- Impulse noise removal by a nonmonotone adaptive gradient method
- Iterative regularization algorithms for constrained image deblurring on graphics processors
- An effective first order reliability method based on Barzilai-Borwein step
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- On the asymptotic convergence and acceleration of gradient methods
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications
- On the inexact scaled gradient projection method
- Complete vehicle energy management using adaptive primal-dual operator splitting
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- On the acceleration of the Barzilai-Borwein method
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
- Ritz-like values in steplength selections for stochastic gradient methods
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- 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
- Variable metric techniques for forward-backward methods in imaging
- Improved SVRG for finite sum structure optimization with application to binary classification
- 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
- Cooperative concurrent asynchronous computation of the solution of symmetric linear systems
- On the steplength selection in gradient methods for unconstrained optimization
- Inexact Bregman iteration for deconvolution of superimposed extended and point sources
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- A harmonic framework for stepsize selection in gradient methods
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- Benchmarking large-scale distributed convex quadratic programming algorithms
- Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy
- On some steplength approaches for proximal algorithms
- A new gradient method via least change secant update
- Gradient methods for large scale convex quadratic functions
- New adaptive Barzilai-Borwein step size and its application in solving large-scale optimization problems
- Direct search conjugate gradient method based on adaptive Barzilai-Borwein step-size
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- Step-sizes for the gradient method
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
- Alternate step gradient method*
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- An efficient gradient method using the Yuan steplength
- On projected alternating BB methods for variational inequalities
- An ADMM-based interior-point method for large-scale linear programming
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points
- Delayed gradient methods for symmetric and positive definite linear systems
- Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
- Computation of sum of squares polynomials from data points
- Gradient methods exploiting spectral properties
- scientific article; zbMATH DE number 7306906 (Why is no real title available?)
- A simple adaptive step-size choice for iterative optimization methods
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- Real-time adaptive optics with pyramid wavefront sensors. II: Accurate wavefront reconstruction using iterative methods
- Adaptive two-point stepsize gradient algorithm
- 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
- Adaptive step size rules for stochastic optimization in large-scale learning
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- An overview of nonlinear optimization
- A stochastic variance reduced gradient method with adaptive step for stochastic optimization
- Cyclic gradient methods for unconstrained optimization
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- 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
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems
- Convergence analysis of the indefinite proximal augmented Lagrange method under strongly convex conditions
- A hybrid spectral projection-based method for solving monotone nonlinear systems and signal recovery
- Adaptive cyclic gradient methods with interpolation
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
- A cyclic delayed weighted steplength for the gradient method
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- Spectral stochastic gradient method with additional sampling for finite and infinite sums
- A note on R-linear convergence of nonmonotone gradient methods
- A conic regularized Barzilai-Borwein trust region method for large scale unconstrained optimization
- A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
- On a family of relaxed gradient descent methods for strictly convex quadratic minimization
- Fast maximum likelihood estimation for general hierarchical models
- Regularized Barzilai-Borwein method
- An adaptive stochastic gradient method with variance reduction for smooth optimization problems
- A speed up strategy for gradient methods
- Stochastic optimization algorithms for biomedical image classification
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- A new steplength selection for scaled gradient methods with application to image deblurring
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)
