Comparison of Two Proximal Point Algorithms for Monotone Variational Inequalities

Authors:
Min Li;Minghua Xu
Affiliations:
Department of Mathematics, Nanjing University, Nanjing, 210093, P.R. China;Department of Information Science, Jiangsu Polytechnic University, Changzhou, 213016, P.R. China
Venue:
Computers & Mathematics with Applications
Year:
2006

Citing 5
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming

Mathematics of Operations Research
A proximal-based decomposition method for convex minimization problems

Mathematical Programming: Series A and B
Engineering and Economic Applications of Complementarity Problems

SIAM Review
Approximate iterations in Bregman-function-based proximal algorithms

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.09

Visualization

Abstract

Since proximal point algorithms (abbreviated as PPA) are attractive for solving monotone variational inequality problems, various approximate versions of PPA (APPA) are developed for practical applications. In this paper, we make a comparison between two different versions of APPAs (APPA I and APPA II) in the literature which share some common properties. Both of the algorithms use the same inexactness restriction and the same step length. The only difference is that they use different search directions. Through theoretical analysis and numerical experiment, we can see that APPA II usually performs better than APPA I.