An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
From MaRDI portal
Publication:2132432
DOI10.1007/s10543-021-00886-9zbMath1491.90113OpenAlexW3192270898MaRDI QIDQ2132432
Harry Oviedo, Oscar Dalmau, Rafael Herrera
Publication date: 28 April 2022
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-021-00886-9
Convex programming (90C25) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Methods of reduced gradient type (90C52)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient gradient method using the Yuan steplength
- Gradient methods with adaptive step-sizes
- Linear and nonlinear programming.
- New adaptive stepsize selections in gradient methods
- Introductory lectures on convex optimization. A basic course.
- A delayed weighted gradient method for strictly convex quadratic minimization
- The university of Florida sparse matrix collection
- Two Novel Gradient Methods with Optimal Step Sizes
- Two-Point Step Size Gradient Methods
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- A hybrid gradient method for strictly convex quadratic programming
- Some methods of speeding up the convergence of iteration methods
- Methods of conjugate gradients for solving linear systems
This page was built for publication: An accelerated minimal gradient method with momentum for strictly convex quadratic optimization