13 citations · 26 across the 17 of their papers we have counts for
19 papers
Alternating Proximity Mapping Method for Strongly Convex-Strongly Concave Saddle-Point Problems
Hui Ouyang
This is a continuation of our previous work entitled \enquote{Alternating Proximity Mapping Method for Convex-Concave Saddle-Point Problems}, in which we proposed the alternating p…
A Note on the Convergence of the OGAProx
Hui Ouyang
In this note, we consider the Optimistic Gradient Ascent-Proximal Point Algorithm (OGAProx) proposed by Bo{ţ}, Csetnek, and Sedlmayer for solving a saddle-point problem associated…
Alternating Proximal Point Algorithm with Gradient Descent and Ascent Steps for Convex-Concave Saddle-Point Problems
Hui Ouyang
Inspired by the Optimistic Gradient Ascent-Proximal Point Algorithm (OGAProx) proposed by Bo{ţ}, Csetnek, and Sedlmayer for solving a saddle-point problem associated with a convex-…
Alternating Subgradient Methods for Convex-Concave Saddle-Point Problems
Hui Ouyang
We propose an alternating subgradient method with non-constant step sizes for solving convex-concave saddle-point problems associated with general convex-concave functions. We assu…
Alternating Proximity Mapping Method for Convex-Concave Saddle-Point Problems
Hui Ouyang
We proposed an iterate scheme for solving convex-concave saddle-point problems associated with general convex-concave functions. We demonstrated that when our iterate scheme is app…
Linear Convergence of Generalized Proximal Point Algorithms for Monotone Inclusion Problems
Hui Ouyang
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is m…