Proximal gradient algorithms under local Lipschitz gradient continuity: A convergence and robustness analysis of PANOC

A De Marchi, A Themelis - Journal of Optimization Theory and Applications, 2022 - Springer
Composite optimization offers a powerful modeling tool for a variety of applications and is
often numerically solved by means of proximal gradient methods. In this paper, we consider …

Low-rank room impulse response estimation

M Jälmby, F Elvander… - IEEE/ACM Transactions …, 2023 - ieeexplore.ieee.org
In this paper we consider low-rank estimation of room impulse responses (RIRs). Inspired by
a physics-driven room-acoustical model, we propose an estimator of RIRs that promotes a …

Online learning over dynamic graphs via distributed proximal gradient algorithm

R Dixit, AS Bedi, K Rajawat - IEEE Transactions on Automatic …, 2020 - ieeexplore.ieee.org
We consider the problem of tracking the minimum of a time-varying convex optimization
problem over a dynamic graph. Motivated by target tracking and parameter estimation …

Structured LISTA for multidimensional harmonic retrieval

R Fu, Y Liu, T Huang, YC Eldar - IEEE transactions on signal …, 2021 - ieeexplore.ieee.org
Learned iterative shrinkage thresholding algorithm (LISTA), which adopts deep learning
techniques to optimize algorithm parameters from labeled training data, can be successfully …

FrankWolfe. jl: A high-performance and flexible toolbox for Frank–Wolfe algorithms and conditional gradients

M Besançon, A Carderera… - INFORMS Journal on …, 2022 - pubsonline.informs.org
We present FrankWolfe. jl, an open-source implementation of several popular Frank–Wolfe
and conditional gradients variants for first-order constrained optimization. The package is …

A projected proximal gradient method for efficient recovery of spectrally sparse signals

X Yao, W Dai - 2023 31st European Signal Processing …, 2023 - ieeexplore.ieee.org
This paper investigates the recovery of a spectrally sparse signal (SSS) from partially
observed entries, with particular emphasis on computational efficiency for large scaled …

Square root-based multi-source early PSD estimation and recursive RETF update in reverberant environments by means of the orthogonal Procrustes problem

T Dietzen, S Doclo, M Moonen… - … /ACM Transactions on …, 2020 - ieeexplore.ieee.org
Multi-channel short-time Fourier transform (STFT) domain-based processing of reverberant
microphone signals commonly relies on power-spectral-density (PSD) estimates of early …

Deep unfolding network for block-sparse signal recovery

R Fu, V Monardo, T Huang, Y Liu - ICASSP 2021-2021 IEEE …, 2021 - ieeexplore.ieee.org
Block-sparse signal recovery has drawn increasing attention in many areas of signal
processing, where the goal is to recover a high-dimensional signal whose non-zero …

Proximal algorithms for structured nonconvex optimization

A Themelis - 2018 - e-theses.imtlucca.it
Due to their simplicity and versatility, splitting algorithms are often the methods of choice for
many optimization problems arising in engineering.“Splitting” complex problems into simpler …

Proximal methods for nonconvex composite optimization problems

T Lechner - 2022 - opus.bibliothek.uni-wuerzburg.de
Optimization problems with composite functions deal with the minimization of the sum of a
smooth function and a convex nonsmooth function. In this thesis several numerical methods …