• Aucun résultat trouvé

Local Linear Convergence of Douglas-Rachford/ADMM for Low Complexity Regularization

N/A
N/A
Protected

Academic year: 2021

Partager "Local Linear Convergence of Douglas-Rachford/ADMM for Low Complexity Regularization"

Copied!
2
0
0

Texte intégral

Loading

Figure

Fig. 1. Observed (solid) and predicted (dashed) convergence profiles of DR (2) in terms of ||z k − z ⋆ ||

Références

Documents relatifs

Dans toute la feuille, K désigne un corps commutatif..

n a n x n ayant un rayon de convergence R > 0 d´ efinit sur l’intervalle ] − R, R[ (ou sur le disque |x| < R si l’on travaille avec une variable complexe) une fonction

Moreover, when these functions are partly polyhedral, we prove that DR (resp. ADMM) is locally linearly convergent with a rate in terms of the cosine of the Friedrichs angle between

Keywords: Douglas–Rachford splitting, ADMM, Partial Smoothness, Finite Activity Identification, Local Linear Convergence..

In particular, our work extends the applications of the proximal point methods for solving constrained minimization problems with non- convex objective functions in Euclidean

The goal of this work is to understand the local linear convergence behaviour of Douglas–Rachford (resp. alternating direction method of multipliers) when the in- volved

Chang, “Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imagery,” IEEE Transactions on Geoscience and Remote

We will also show that for nonconvex sets A, B the Douglas–Rachford scheme may fail to converge and start to cycle without solving the feasibility problem.. We show that this may