Computational Mathematics for Learning and Data An...
Software and support material
The Dual-Ascent Method (Antonio Frangioni)
Lagrangian Dual methods for strictly convex quadratic problems with linear constraints. Extension: decomposition methods for structured problems. MATLAB implementation of a Dual-Ascent method for Box-Constrained (strictly convex) Quadratic Programs, main points, discussion of performances (impact of the Lagrangian heuristic).