Yuchao Tang

Prof. Yuchao Tang

Nanchang University, Nanchang, Jiangxi, China
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2017 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
AGAviv Gibali
Aviv Gibali
LLLi-Wei Liu
Li-Wei Liu
YTYuchao Tang
Yuchao Tang

1 November 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
CZChunxiang Zong
Chunxiang Zong
YTYuchao Tang
Yuchao Tang
Yeol Je ChoYeol Je Cho
Yeol Je Cho
The three-operator splitting algorithm is a new splitting algorithm for finding monotone inclusion problems of the sum of three maximally monotone operators, where one is cocoercive. As the resolvent operator is not available in a closed form in the original three-operator splitting algorithm, in this paper, we introduce an inexact three-operator splitting algorithm to solve this type of monotone inclusion problem. The theoretical convergence properties of the proposed iterative algorithm are studied in general Hilbert spaces under mild conditions on the iterative parameters. As a corollary, we obtain general convergence results of the inexact forward-backward splitting algorithm and the inexact Douglas-Rachford splitting algorithm, which extend the existing results in the literature.

3 January 2017 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
MWMeng Wen
Meng Wen
JPJigen Peng
Jigen Peng
YTYuchao Tang
Yuchao Tang
CZChuanxi Zhu
Chuanxi Zhu
SYShigang Yue
Shigang Yue
We introduce a preconditioning technique for the first‐order primal‐dual splitting method. The primal‐dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self‐adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.

20 May 2019 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
FCFuying Cui
Fuying Cui
YTYuchao Tang
Yuchao Tang
CZChuanxi Zhu
Chuanxi Zhu
The forward–backward splitting algorithm is a popular operator-splitting method for solving monotone inclusion of the sum of a maximal monotone operator and an inverse strongly monotone operator. In this paper, we present a new convergence analysis of a variable metric forward–backward splitting algorithm with extended relaxation parameters in real Hilbert spaces. We prove that this algorithm is weakly convergent when certain weak conditions are imposed upon the relaxation parameters. Consequently, we recover the forward–backward splitting algorithm with variable step sizes. As an application, we obtain a variable metric forward–backward splitting algorithm for solving the minimization problem of the sum of two convex functions, where one of them is differentiable with a Lipschitz continuous gradient. Furthermore, we discuss the applications of this algorithm to the fundamental of the variational inequalities problem, constrained convex minimization problem, and split feasibility problem. Numerical experimental results on LASSO problem in statistical learning demonstrate the effectiveness of the proposed iterative algorithm.


10 November 2017 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
QDQiao-Li Dong
Qiao-Li Dong
AGAviv Gibali
Aviv Gibali
DJD Jiang
D Jiang
YTYuchao Tang
Yuchao Tang
In this paper we study the bounded perturbation resilience of the extragradient and the subgradient extragradient methods for solving a variational inequality (VI) problem in real Hilbert spaces. This is an important property of algorithms which guarantees the convergence of the scheme under summable errors, meaning that an inexact version of the methods can also be considered. Moreover, once an algorithm is proved to be bounded perturbation resilience, superiorization can be used, and this allows flexibility in choosing the bounded perturbations in order to obtain a superior solution, as well explained in the paper. We also discuss some inertial extragradient methods. Under mild and standard assumptions of monotonicity and Lipschitz continuity of the VI’s associated mapping, convergence of the perturbed extragradient and subgradient extragradient methods is proved. In addition we show that the perturbed algorithms converge at the rate of O ( 1 / t ) $O(1/t)$ . Numerical illustrations are given to demonstrate the performances of the algorithms.