Pages that link to "Item:Q853675"
From MaRDI portal
The following pages link to Gradient methods with adaptive step-sizes (Q853675):
Displaying 50 items.
- On some steplength approaches for proximal algorithms (Q298853) (← links)
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
- An efficient gradient method using the Yuan steplength (Q480934) (← links)
- A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies (Q827072) (← links)
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← links)
- A new steplength selection for scaled gradient methods with application to image deblurring (Q897119) (← links)
- New adaptive stepsize selections in gradient methods (Q1008801) (← links)
- A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- Stochastic gradient descent with Barzilai-Borwein update step for SVM (Q1749833) (← links)
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056) (← links)
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm (Q1790679) (← links)
- An adaptive bacterial foraging optimization algorithm with lifecycle and social learning (Q1925498) (← links)
- A cyclic projected gradient method (Q1946620) (← links)
- Impulse noise removal by a nonmonotone adaptive gradient method (Q1957285) (← links)
- Iterative regularization algorithms for constrained image deblurring on graphics processors (Q1959245) (← links)
- An effective first order reliability method based on Barzilai-Borwein step (Q1988795) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
- On the asymptotic convergence and acceleration of gradient methods (Q2053340) (← links)
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications (Q2059821) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- Complete vehicle energy management using adaptive primal-dual operator splitting (Q2081810) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization (Q2132432) (← links)
- Ritz-like values in steplength selections for stochastic gradient methods (Q2156893) (← links)
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming (Q2156911) (← links)
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems (Q2161068) (← links)
- Two-point step size gradient method for solving a deep learning problem (Q2190628) (← links)
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (Q2195925) (← links)
- Variable metric techniques for forward-backward methods in imaging (Q2222135) (← links)
- Improved SVRG for finite sum structure optimization with application to binary classification (Q2244210) (← links)
- A delayed weighted gradient method for strictly convex quadratic minimization (Q2282816) (← links)
- Accelerated augmented Lagrangian method for total variation minimization (Q2322436) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- Cooperative concurrent asynchronous computation of the solution of symmetric linear systems (Q2407864) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- Inexact Bregman iteration for deconvolution of superimposed extended and point sources (Q2513873) (← links)
- Barzilai-Borwein-like methods for the extreme eigenvalue problem (Q2514702) (← links)
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
- A harmonic framework for stepsize selection in gradient methods (Q2701417) (← links)
- Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems (Q2867405) (← links)
- Scaling techniques for gradient projection-type methods in astronomical image deblurring (Q2868153) (← links)
- Benchmarking large-scale distributed convex quadratic programming algorithms (Q2943814) (← links)
- Randomized algorithms for high quality treatment planning in volumetric modulated arc therapy (Q2965689) (← links)
- NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS (Q3122031) (← links)
- Direct search conjugate gradient method based on adaptive Barzilai-Borwein step-size (Q3131693) (← links)
