Proximal-Point Algorithm Using a Linear Proximal Term |
| |
Authors: | B. S. He X. L. Fu Z. K. Jiang |
| |
Affiliation: | (1) Department of Mathematics, Nanjing University, Nanjing, 210093, China |
| |
Abstract: | Proximal-point algorithms (PPAs) are classical solvers for convex optimization problems and monotone variational inequalities (VIs). The proximal term in existing PPAs usually is the gradient of a certain function. This paper presents a class of PPA-based methods for monotone VIs. For a given current point, a proximal point is obtained via solving a PPA-like subproblem whose proximal term is linear but may not be the gradient of any functions. The new iterate is updated via an additional slight calculation. Global convergence of the method is proved under the same mild assumptions as the original PPA. Finally, profiting from the less restrictions on the linear proximal terms, we propose some parallel splitting augmented Lagrangian methods for structured variational inequalities with separable operators. B.S. He was supported by NSFC Grant 10571083 and Jiangsu NSF Grant BK2008255. |
| |
Keywords: | Variational inequalities Monotone variational inequalities Proximal point algorithms Linear proximal terms |
本文献已被 SpringerLink 等数据库收录! |