## Abstract

Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches for convex optimization problems and monotone variational inequalities. To solve the subproblems of these algorithms, the projection method takes the iteration in form of u ^{k+1} = P _{Ω}[u ^{k} - α _{k}d ^{k}]. Interestingly, many of them can be paired such that ũ ^{k} = P _{Ω}[u ^{k} - β _{k}F(v ^{k})] = P _{Ω}[ũ ^{k} - (d ^{k} _{2} - Gd ^{k} _{1})], where inf{β _{k}} > 0 and G is a symmetric positive definite matrix. In other words, this projection equation offers a pair of directions, i.e., d ^{k} _{1} and d ^{k} _{2} for each step. In this paper, for various APPAs we present a unified framework involving the above equations. Unified characterization is investigated for the contraction and convergence properties under the framework. This shows some essential views behind various outlooks. To study and pair various APPAs for different types of variational inequalities, we thus construct the above equations in different expressions according to the framework. Based on our constructed frameworks, it is interesting to see that, by choosing one of the directions (d ^{k} _{1} and d ^{k} _{2}) those studied proximal-like methods always utilize the unit step size namely α _{k} ≡ 1.

Original language | English |
---|---|

Pages (from-to) | 649-679 |

Number of pages | 31 |

Journal | Computational Optimization and Applications |

Volume | 51 |

Issue number | 2 |

DOIs | |

Publication status | Published - Mar 2012 |

## Scopus Subject Areas

- Control and Optimization
- Computational Mathematics
- Applied Mathematics

## User-Defined Keywords

- Contraction methods
- Monotone
- Variational inequality