15 citations · 31 across the 9 of their papers we have counts for
9 papers
Inertial nonconvex alternating minimizations for the image deblurring
Tao Sun, Roberto Barrio, Marcos Rodriguez +1
In image processing, Total Variation (TV) regularization models are commonly used to recover blurred images. One of the most efficient and popular methods to solve the convex TV pr…
Heavy-ball Algorithms Always Escape Saddle Points
Tao Sun, Dongsheng Li, Zhe Quan +3
Nonconvex optimization algorithms with random initialization have attracted increasing attention recently. It has been showed that many first-order methods always avoid saddle poin…
Bregman Proximal Gradient Algorithm with Extrapolation for a class of Nonconvex Nonsmooth Minimization Problems
Xiaoya Zhang, Roberto Barrio, M. Angeles Martinez +2
In this paper, we consider an accelerated method for solving nonconvex and nonsmooth minimization problems. We propose a Bregman Proximal Gradient algorithm with extrapolation(BPGe…
Iteratively reweighted penalty alternating minimization methods with continuation for image deblurring
Tao Sun, Dongsheng Li, Hao Jiang +1
In this paper, we consider a class of nonconvex problems with linear constraints appearing frequently in the area of image processing. We solve this problem by the penalty method a…
Non-ergodic Convergence Analysis of Heavy-Ball Algorithms
Tao Sun, Penghang Yin, Dongsheng Li +3
In this paper, we revisit the convergence of the Heavy-ball method, and present improved convergence complexity results in the convex setting. We provide the first non-ergodic O(1/…
A convergence framework for inexact nonconvex and nonsmooth algorithms and its applications to several iterations
Tao Sun, Hao Jiang, Lizhi Cheng +1
In this paper, we consider the convergence of an abstract inexact nonconvex and nonsmooth algorithm. We promise a pseudo sufficient descent condition and a pseudo relative error co…