A hybrid gradient method for strictly convex quadratic programming

DOI10.1002/NLA.2360MaRDI QIDQ4959588zbMATH OpenOpenAlexWikidataFDO

Authors Harry Oviedo, Oscar Dalmau, Rafael Herrera

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

convex quadratic optimizationgradient methodslinear system of equations

Mathematics Subject Classification ID

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

Recommendations

• A delayed weighted gradient method for strictly convex quadratic minimization
• An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
• A hybrid direction algorithm for solving a convex quadratic problem
• A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
• An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem

Cited in

(7)

• A hypoquadratic convergence method for Lagrange multipliers
• An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
• A second-order gradient method for convex minimization
• A delayed weighted gradient method for strictly convex quadratic minimization
• A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
• Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
• A cyclic delayed weighted steplength for the gradient method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959588)