Back to Search
Start Over
Proximal-Point Algorithm Using a Linear Proximal Term.
- Source :
-
Journal of Optimization Theory & Applications . May2009, Vol. 141 Issue 2, p299-319. 21p. 3 Charts, 5 Graphs. - Publication Year :
- 2009
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00223239
- Volume :
- 141
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Journal of Optimization Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 37826405
- Full Text :
- https://doi.org/10.1007/s10957-008-9493-0