Primal-dual splitting scheme with backtracking for handling with epigraphic constraint and sparse analysis regularization

09/08/2020
by   Laurence Denneulin, et al.
0

The convergence of many proximal algorithms involving a gradient descent relies on its Lipschitz constant. To avoid computing it, backtracking rules can be used. While such a rule has already been designed for the forward-backward algorithm (FBwB), this scheme is not flexible enough when a non-differentiable penalization with a linear operator is added to a constraint. In this work we propose a backtracking rule for the primal-dual scheme (PDwB), and evaluate its performance for the epigraphical constrained high dynamical reconstruction in high contrast polarimetric imaging, under TV penalization.

READ FULL TEXT
research
11/14/2019

Primal-dual block-proximal splitting for a class of non-convex problems

We develop block structure adapted primal-dual algorithms for non-convex...
research
03/18/2016

A Flexible Primal-Dual Toolbox

FlexBox is a flexible MATLAB toolbox for finite dimensional convex varia...
research
01/01/2022

On the improved conditions for some primal-dual algorithms

The convex minimization of f(𝐱)+g(𝐱)+h(𝐀𝐱) over ℝ^n with differentiable ...
research
10/28/2021

A first-order primal-dual method with adaptivity to local smoothness

We consider the problem of finding a saddle point for the convex-concave...
research
07/20/2017

Learned Primal-dual Reconstruction

We propose the Learned Primal-Dual algorithm for tomographic reconstruct...
research
11/04/2020

Convolutional Proximal Neural Networks and Plug-and-Play Algorithms

In this paper, we introduce convolutional proximal neural networks (cPNN...
research
02/20/2022

Alternative design of DeepPDNet in the context of image restoration

This work designs an image restoration deep network relying on unfolded ...

Please sign up or login with your details

Forgot password? Click here to reset