Inexact Alternating Direction Method Based on Newton descent algorithm with Application to Poisson Image Deblurring
The recovery of images from the observations that are degraded by a linear operator and further corrupted by Poisson noise is an important task in modern imaging applications such as astronomical and biomedical ones. Gradient-based regularizers involve the popular total variation semi-norm have become standard techniques for Poisson image restoration due to its edge-preserving ability. Various efficient algorithms have been developed for solving the corresponding minimization problem with non-smooth regularization terms. In this paper, motivated by the idea of the alternating direction minimization algorithm and the Newton's method with upper convergent rate, we further propose inexact alternating direction methods utilizing the proximal Hessian matrix information of the objective function, in a way reminiscent of Newton descent methods. Besides, we also investigate the global convergence of the proposed algorithms under certain conditions. Finally, we illustrate that the proposed algorithms outperform the current state-of-the-art algorithms through numerical experiments on Poisson image deblurring.
Code (0)
등록된 구현이 없습니다.
Tasks
DeblurringImage DeblurringImage RestorationSimilar Papers 제목 키워드 기반
Newton-ADMM: A Distributed GPU-Accelerated Optimizer for Multiclass Classification Problems
First-order optimization methods, such as stochastic gradient descent (SGD) and its variants, are widely used in machine learning applications due to their simplicity and low per-iteration costs. However, they often requ…
General ClassificationGPULearnable MIMO Detection Networks Based on Inexact ADMM
In this article, we present a new iterative MIMO detection algorithm based on inexact alternating direction method of multipliers. Each iteration is considered as a neural network layer with learnable parameters, which a…
DecoderFederated Learning via Inexact ADMM
One of the crucial issues in federated learning is how to develop efficient optimization algorithms. Most of the current ones require full device participation and/or impose strong assumptions for convergence. Different …
Federated LearningBregman Alternating Direction Method of Multipliers
The mirror descent algorithm (MDA) generalizes gradient descent by using a Bregman divergence to replace squared Euclidean distance. In this paper, we similarly generalize the alternating direction method of multipliers …
GPUALADIN-$α$ -- An open-source MATLAB toolbox for distributed non-convex optimization
This paper introduces an open-source software for distributed and decentralized non-convex optimization named ALADIN-$\alpha$. ALADIN-$\alpha$ is a MATLAB implementation of tailored variants of the Augmented Lagrangian A…
Distributed Optimization