On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
From MaRDI portal
Publication:3111111
DOI10.1088/0266-5611/27/12/125007zbMath1233.65039arXiv1104.1087OpenAlexW3105279496MaRDI QIDQ3111111
Ignace Loris, Caroline Verhoeven
Publication date: 17 January 2012
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1087
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Seismology (including tsunami modeling), earthquakes (86A15)
Related Items
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions ⋮ A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems ⋮ Gradient descent technology for sparse vector learning in ontology algorithms ⋮ Unified linear convergence of first-order primal-dual algorithms for saddle point problems ⋮ Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting ⋮ Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems ⋮ Testing and non-linear preconditioning of the proximal point method ⋮ Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch ⋮ An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography ⋮ Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes ⋮ Bregman three-operator splitting methods ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization ⋮ A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization ** ⋮ Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO ⋮ Iterative algorithms for total variation-like reconstructions in seismic tomography ⋮ On starting and stopping criteria for nested primal-dual iterations ⋮ New convergence analysis of a primal-dual algorithm with large stepsizes ⋮ Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm ⋮ A new primal-dual algorithm for minimizing the sum of three functions with a linear operator ⋮ Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization ⋮ A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions ⋮ Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration ⋮ Dualize, split, randomize: toward fast nonsmooth optimization algorithms ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ A nested primal-dual FISTA-like scheme for composite convex optimization problems
