paper-with-me

홈 › Papers

Proximal Gradient Algorithms: Applications in Signal Processing

2020-01-27

Advances in numerical optimization have supported breakthroughs in several areas of signal processing. This paper focuses on the recent enhanced variants of the proximal gradient numerical optimization algorithm, which combine quasi-Newton methods with forward-adjoint oracles to tackle large-scale problems and reduce the computational burden of many applications. These proximal gradient algorithms are here described in an easy-to-understand way, illustrating how they are able to address a wide variety of problems arising in signal processing. A new high-level modeling language is presented which is used to demonstrate the versatility of the presented algorithms in a series of signal processing application examples such as sparse deconvolution, total variation denoising, audio de-clipping and others.

📄 PDF Abstract BibTeX arXiv:1803.01621

Code (0)

등록된 구현이 없습니다.

Tasks

Denoising

Similar Papers 제목 키워드 기반

Decentralized Accelerated Proximal Gradient Descent

2020-12-01 · NeurIPS 2020 12 · Haishan Ye, Ziang Zhou, Luo Luo, Tong Zhang

Decentralized optimization has wide applications in machine learning, signal processing, and control. In this paper, we study the decentralized composite optimization problem with a non-smooth regularization term…

BIG-bench Machine Learning

First-Order Methods for Convex Optimization

2021-01-04 · Pavel Dvurechensky, Mathias Staudigl, Shimrit Shtern

First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the s…

Survey

Leveraging Two Reference Functions in Block Bregman Proximal Gradient Descent for Non-convex and Non-Lipschitz Problems

2019-12-16 · Tianxiang Gao, Songtao Lu, Jia Liu, Chris Chu

In the applications of signal processing and data analytics, there is a wide class of non-convex problems whose objective function is freed from the common global Lipschitz continuous gradient assumption (e.g., the nonne…

Inexact Proximal Gradient Methods for Non-convex and Non-smooth Optimization

2016-12-18 · Bin Gu, De Wang, Zhouyuan Huo, Heng Huang

In machine learning research, the proximal gradient methods are popular for solving various optimization problems with non-smooth regularization. Inexact proximal gradient methods are extremely important when exactly sol…

BIG-bench Machine Learning

Accelerated Block Coordinate Proximal Gradients with Applications in High Dimensional Statistics

2017-10-15 · Tsz Kit Lau, Yuan YAO

Nonconvex optimization problems arise in different research fields and arouse lots of attention in signal processing, statistics and machine learning. In this work, we explore the accelerated proximal gradient method and…

BIG-bench Machine LearningregressionVocal Bursts Intensity Prediction