Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding

DOI10.1155/2020/4367515zbMath1459.94081OpenAlexW3046754586MaRDI QIDQ2193348

Yanyan Li

Publication date: 25 August 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/4367515

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Source coding (94A29)

Cites Work

• Unnamed Item
• Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
• Feasibility pump algorithm for sparse representation under Laplacian noise
• First-Order Methods in Optimization
• Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding
• Multi-Layer Convolutional Sparse Modeling: Pursuit and Dictionary Learning
• On the Convergence of Block Coordinate Descent Type Methods
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding