Zhengshan Dong

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper proposes a new customized proximal point algorithm for linearly constrained convex optimization problem, and further extends the proposed method to separable convex optimization problem with linear constraints. The global convergence and a worst-case convergence rate of the proposed methods are proven under some mild assumptions. Preliminary(More)
  • 1