A hybrid gradient method for strictly convex quadratic programming

DOI10.1002/NLA.2360OpenAlexW3117811601WikidataQ114852902 ScholiaQ114852902MaRDI QIDQ4959588

Oscar Dalmau, Rafael Herrera, Harry Oviedo

Publication date: 16 September 2021

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2360

zbMATH Keywords

gradient methodslinear system of equationsconvex quadratic optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)

Related Items (3)

An accelerated minimal gradient method with momentum for strictly convex quadratic optimization ⋮ A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization ⋮ A second-order gradient method for convex minimization

This page was built for publication: A hybrid gradient method for strictly convex quadratic programming