An improved first-order primal-dual algorithm with a new correction step

Authors:
Xingju Cai;Deren Han;Lingling Xu
Affiliations:
Mathematical department, Nanjing university, Nanjing, P. R. China 210023 and Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, P. R. China 210 ...;Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, P. R. China 210023;Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, P. R. China 210023
Venue:
Journal of Global Optimization
Year:
2013

Citing 6
Cited 0

Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

SIAM Journal on Optimization
An operator splitting method for variational inequalities with partially unknown mappings

Numerische Mathematik
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging

Journal of Mathematical Imaging and Vision
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science

SIAM Journal on Imaging Sciences
On the $O(1/n)$ Convergence Rate of the Douglas-Rachford Alternating Direction Method

SIAM Journal on Numerical Analysis
Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective

SIAM Journal on Imaging Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new correction strategy for some first-order primal-dual algorithms arising from solving, e.g., total variation image restoration. With this strategy, we can prove the convergence of the algorithm under more flexible conditions than those proposed most recently. Some preliminary numerical results of image deblurring support that the new correction strategy can improve the numerical efficiency.