NAGSC: Nesterov's accelerated gradient methods for sparse coding

zbMATH Open1475.90143MaRDI QIDQ5226926FDOQ5226926

Authors: Liang Liu, Ling Zhang, Xiangguang Dai, Yuming Feng 

Publication date: 2 August 2019

Full work available at URL: http://ijpam.uniud.it/online_issue/201840/59-Liu-Zhang-Dai-Feng.pdf

Recommendations

• Proximal alternating method for dictionary learning
• Convergence of sparse coding based on KKT conditions
• Bag of pursuits and neural gas for improved sparse coding
• Online learning for matrix factorization and sparse coding
• Proximal methods for hierarchical sparse coding

zbMATH Keywords

nonconvexnonsmoothaccelerated gradientsparse coding

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (6)

• Proximal methods for hierarchical sparse coding
• Convergence of sparse coding based on KKT conditions
• Robust sparse coding via self-paced learning for data representation
• Proximal alternating method for dictionary learning
• Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding
• Bag of pursuits and neural gas for improved sparse coding

This page was built for publication: NAGSC: Nesterov's accelerated gradient methods for sparse coding

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