Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
From MaRDI portal
Publication:6606853
Recommendations
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- A delayed weighted gradient method for strictly convex quadratic minimization
- Properties of the delayed weighted gradient method
- A hybrid gradient method for strictly convex quadratic programming
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
Cites work
- scientific article; zbMATH DE number 4147424 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonmonotone Line Search Technique for Newton’s Method
- A delayed weighted gradient method for strictly convex quadratic minimization
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- A family of spectral gradient methods for optimization
- A harmonic framework for stepsize selection in gradient methods
- A hybrid gradient method for strictly convex quadratic programming
- A limited memory steepest descent method
- A literature survey of benchmark functions for global optimisation problems
- A new stepsize for the steepest descent method
- Algorithm 851
- Alternate step gradient method*
- An efficient gradient method using the Yuan steplength
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- An unconstrained optimization test functions collection
- Analysis of monotone gradient methods
- Benchmarking optimization software with performance profiles.
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- Gradient Method with Retards and Generalizations
- Gradient methods exploiting spectral properties
- Gradient methods with adaptive step-sizes
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Methods of conjugate gradients for solving linear systems
- New adaptive stepsize selections in gradient methods
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the acceleration of the Barzilai-Borwein method
- On the application of the spectral projected gradient method in image segmentation
- On the steplength selection in gradient methods for unconstrained optimization
- One class of methods of unconditional minimization of a convex function, having a high rate of convergence
- Properties of the delayed weighted gradient method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Stabilized Barzilai-Borwein method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The University of Florida sparse matrix collection
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Two novel gradient methods with optimal step sizes
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
This page was built for publication: Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606853)
