Convergence analysis of augmented Lagrangian-fast projected gradient method for convex quadratic problems

zbMATH Open1474.90315MaRDI QIDQ5146237FDOQ5146237

Authors: Igor Griva 

Publication date: 25 January 2021

Full work available at URL: http://www.yokohamapublishers.jp/online-p/Pafa/vol3/pafav3n3p417.pdf

Recommendations

• scientific article; zbMATH DE number 2201293
• Augmented Lagrangian methods for convex matrix optimization problems
• On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
• An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence \(O\left({1/{k^2}} \right)\)
• A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize

zbMATH Keywords

machine learningsupport vector machinesquadratic problemsconvex quadratic optimizationconvex problemsfast gradient

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Nonlinear programming (90C30)

Cited In (7)

• Faster Lagrangian-based methods in convex optimization
• Title not available (Why is that?)
• Descent methods with computational errors in Banach spaces
• Stability of the asymptotic behavior for continuous descent methods with a convex objective function
• Dual fast projected gradient method for quadratic programming
• Augmented Lagrangian methods for convex matrix optimization problems
• Two iterative processes generated by regular vector fields in Banach spaces

This page was built for publication: Convergence analysis of augmented Lagrangian-fast projected gradient method for convex quadratic problems

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