A memory efficient incremental gradient method for regularized minimization

DOI10.4134/BKMS.2016.53.2.589MaRDI QIDQ2812605zbMATH OpenOpenAlexFDO

Authors Sangwoon Yun

Publication date 17 June 2016

Published in Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL http://www.mathnet.or.kr/mathnet/kms_content.php?no=467723

zbMATH Keywords

incremental gradient methodnonsmooth functionsregularizationrunning average

Mathematics Subject Classification ID

Decomposition methods (49M27) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• A memory gradient method for non-smooth convex optimization
• A new memory gradient method and its convergence
• scientific article; zbMATH DE number 5951924
• A new class of memory gradient methods with inexact line searches
• A new class of memory gradient methods and its global convergence
• scientific article; zbMATH DE number 6001451
• Incrementally updated gradient methods for constrained and regularized optimization
• An optimal randomized incremental gradient method
• The memory gradient methods for unconstrained optimization
• Exact gradient methods with memory

Cited in

(3)

• Incrementally updated gradient methods for constrained and regularized optimization
• A New Class of Incremental Gradient Methods for Least Squares Problems
• An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: A memory efficient incremental gradient method for regularized minimization

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