Comparison of two proximal point algorithms for monotone variational inequalities

DOI10.1016/j.camwa.2006.05.017zbMath1128.49009OpenAlexW2023734134MaRDI QIDQ2469901

Min Li, Ming-Hua Xu

Publication date: 11 February 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.017

zbMATH Keywords

projectionproximal point algorithmmonotone variational inequalityprofit functioninexactness restriction

Mathematics Subject Classification ID

Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• An approximate proximal-extragradient type method for monotone variational inequalities
• Approximate iterations in Bregman-function-based proximal algorithms
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• Inexact implicit methods for monotone general variational inequalities
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Engineering and Economic Applications of Complementarity Problems
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropic proximal decomposition methods for convex programs and variational inequalities

This page was built for publication: Comparison of two proximal point algorithms for monotone variational inequalities