Comparison of two proximal point algorithms for monotone variational inequalities
DOI10.1016/J.CAMWA.2006.05.017zbMATH Open1128.49009OpenAlexW2023734134MaRDI QIDQ2469901FDOQ2469901
Authors: 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
Recommendations
- Comparison of two approximal proximal point algorithms for monotone variational inequalities
- Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities
- An approximate proximal-extragradient type method for monotone variational inequalities
- scientific article; zbMATH DE number 2109090
- A new modified approximate proximal-extragradient type method for monotone variational inequalities
projectionproximal point algorithmmonotone variational inequalityprofit functioninexactness restriction
Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)
Cites Work
- A proximal-based deomposition method for compositions method for convex minimization problems
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Approximate iterations in Bregman-function-based proximal algorithms
- Engineering and Economic Applications of Complementarity Problems
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Inexact implicit methods for monotone general variational inequalities
- An approximate proximal-extragradient type method for monotone variational inequalities
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Title not available (Why is that?)
Cited In (5)
- A contraction proximal point algorithm with two monotone operators
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- A generalized contraction proximal point algorithm with two monotone operators
- Comparison of two approximal proximal point algorithms for monotone variational inequalities
- Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities
This page was built for publication: Comparison of two proximal point algorithms for monotone variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469901)
