Convergence of sparse coding based on KKT conditions

DOI10.13878/J.CNKI.JNUIST.2020.03.015MaRDI QIDQ3386027zbMATH OpenFDO

Authors Yingyin Tao, Yi Yang, Xiangguang Dai, Xiaojie Su

Publication date 14 January 2021

Full work available at URL https://doi.org/10.13878/J.CNKI.JNUIST.2020.03.015

zbMATH Keywords

convergenceKKT conditionssparse coding

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Nonlinear programming (90C30)

Recommendations

• NAGSC: Nesterov's accelerated gradient methods for sparse coding
• Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• Proximal alternating method for dictionary learning
• Optimality conditions for sparse nonlinear programming

Cited in

(2)

• Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding
• NAGSC: Nesterov's accelerated gradient methods for sparse coding

This page was built for publication: Convergence of sparse coding based on KKT conditions

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