Ya-Ping Fang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ya-Ping Fang has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
Rong Hu
20 shared publications- Rong Hu
Department of Applied Mathematics, Chengdu University of Information Technology, Chengdu, P.R. China
20 shared publications - Xin He
School of Science, Xihua University, Chengdu, China
10 shared publications - Nan-Jing Huang
Sichuan University
9 shared publications Nan-Jing Huang
8 shared publicationsMing Zhu
Department of Mathematics, Sichuan University, Chengdu, Sichuan, P.R. China
3 shared publications
Latest Publications
- 21 October 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 164
From inertial dynamics with implicit Hessian damping to accelerated forward–backward algorithms
- 21 October 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 164
From inertial dynamics with implicit Hessian damping to accelerated forward–backward algorithms
- 7 February 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 158
Accelerated linearized alternating direction method of multipliers with Nesterov extrapolation
- 7 February 2026
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 158
Accelerated linearized alternating direction method of multipliers with Nesterov extrapolation
- Open Access
Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches
In this paper, we study a bilinear saddle point problem of the form $\min_{x}\max_{y} F(x) + \langle Ax, y \rangle - G(y)$, where $F$ and $G$ are $μ_F$- and $μ_G$-strongly convex functions, respectively. By incorporating Nesterov acceleration for strongly convex optimization, we first propose an optimal first-order discrete primal-dual gradient algorithm. We show that it achieves the optimal convergence rate $\mathcal{O}\left(\left(1 - \min\left\{\sqrt{\frac{μ_F}{L_F}}, \sqrt{\frac{μ_G}{L_G}}\right\}\right)^k\right)$ for both the primal-dual gap and the iterative, where $L_F$ and $L_G$ denote the smoothness constants of $F$ and $G$, respectively. We further develop a continuous-time accelerated primal-dual dynamical system with constant damping. Using the Lyapunov analysis method, we establish the existence and uniqueness of a global solution, as well as the linear convergence rate $\mathcal{O}(e^{-\min\{\sqrt{μ_F},\sqrt{μ_G}\}t})$. Notably, when $A = 0$, our methods recover the classical Nesterov accelerated methods for strongly convex unconstrained problems in both discrete and continuous-time. Numerical experiments are presented to support the theoretical convergence rates.Open AccessNesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches
In this paper, we study a bilinear saddle point problem of the form $\min_{x}\max_{y} F(x) + \langle Ax, y \rangle - G(y)$, where $F$ and $G$ are $μ_F$- and $μ_G$-strongly convex functions, respectively. By incorporating Nesterov acceleration for strongly convex optimization, we first propose an optimal first-order discrete primal-dual gradient algorithm. We show that it achieves the optimal convergence rate $\mathcal{O}\left(\left(1 - \min\left\{\sqrt{\frac{μ_F}{L_F}}, \sqrt{\frac{μ_G}{L_G}}\right\}\right)^k\right)$ for both the primal-dual gap and the iterative, where $L_F$ and $L_G$ denote the smoothness constants of $F$ and $G$, respectively. We further develop a continuous-time accelerated primal-dual dynamical system with constant damping. Using the Lyapunov analysis method, we establish the existence and uniqueness of a global solution, as well as the linear convergence rate $\mathcal{O}(e^{-\min\{\sqrt{μ_F},\sqrt{μ_G}\}t})$. Notably, when $A = 0$, our methods recover the classical Nesterov accelerated methods for strongly convex unconstrained problems in both discrete and continuous-time. Numerical experiments are presented to support the theoretical convergence rates. - 21 August 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 93 (1) , 121-156
Accelerated forward-backward algorithms with subgradient corrections
- 21 August 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 93 (1) , 121-156
Accelerated forward-backward algorithms with subgradient corrections
- 2 May 2025
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 43 (01)
An Inexact Linearized Augmented Lagrangian Method for the Linearly Composite Convex Programming
We propose an inexact linearized augmented Lagrangian method for the linear equality constrained convex programming, for which the objective function has a “nonsmooth + smooth” composite structure. We show that both the objective error and the constraint gap associated with the proposed algorithm enjoy an [ ] nonergodic convergence rate. By choosing a specific proximal matrix, we drive a customized linearized augmented Lagrangian method for the problem, where the subproblem can be solved by means of the proximal mapping of a convex function. Finally, we demonstrate the efficiency of the proposed algorithms by two numerical experiments.
- 2 May 2025
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 43 (01)
An Inexact Linearized Augmented Lagrangian Method for the Linearly Composite Convex Programming
We propose an inexact linearized augmented Lagrangian method for the linear equality constrained convex programming, for which the objective function has a “nonsmooth + smooth” composite structure. We show that both the objective error and the constraint gap associated with the proposed algorithm enjoy an [ ] nonergodic convergence rate. By choosing a specific proximal matrix, we drive a customized linearized augmented Lagrangian method for the problem, where the subproblem can be solved by means of the proximal mapping of a convex function. Finally, we demonstrate the efficiency of the proposed algorithms by two numerical experiments.
- 3 February 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (1) , 393-422
Fast primal-dual algorithm with Tikhonov regularization for a linear equality constrained convex optimization problem
- 3 February 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (1) , 393-422
Fast primal-dual algorithm with Tikhonov regularization for a linear equality constrained convex optimization problem