Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization

DOI10.1109/TSP.2019.2959240OpenAlexW2996378342MaRDI QIDQ5102637

No author found.

Publication date: 23 September 2022

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.04211

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (5)

Scalable subspace methods for derivative-free nonlinear least-squares optimization ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ Analysis of a variable metric block coordinate method under proximal errors ⋮ A new data-driven robust optimization approach to multi-item newsboy problems ⋮ Recovery under side constraints

This page was built for publication: Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization