Inexact proximal point method for general variational inequalities

DOI10.1016/J.JMAA.2006.01.014zbMath1101.49026OpenAlexW2041132162MaRDI QIDQ852837

Abdellah Bnouhachem, Muhammad Aslam Noor

Publication date: 15 November 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.01.014

zbMATH Keywords

projection methodsproximal point algorithmsgeneral variational inequalitiesinexact criterion

Mathematics Subject Classification ID

Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37)

Related Items (11)

The developments of proximal point algorithms ⋮ Some iterative methods for general nonconvex variational inequalities ⋮ An approximate proximal point algorithm for maximal monotone inclusion problems ⋮ Implicit schemes for solving extended general nonconvex variational inequalities ⋮ Some aspects of extended general variational inequalities ⋮ Some iterative methods for nonconvex variational inequalities ⋮ On convergence criteria of generalized proximal point algorithms ⋮ Predictor-corrector methods for multi-valued hemiequilibrium problems ⋮ Algorithmic approach to the split problems ⋮ A general self-adaptive relaxed-PPA method for convex programming with linear constraints ⋮ Self-adaptive methods for general variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating direction method for maximum entropy subject to simple constraint sets.
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Merit functions for general variational inequalities
• Self-adaptive methods for general variational inequalities
• A note on a globally convergent Newton method for solving monotone variational inequalities
• General variational inequalities
• Approximate iterations in Bregman-function-based proximal algorithms
• Some aspects of variational inequalities
• 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
• Self-adaptive projection algorithms for general variational inequalities
• New extragradient-type methods for general variational inequalities.
• Some developments in general variational inequalities
• Projection-proximal methods for general variational inequalities
• A self-adaptive method for solving general mixed variational inequalities
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
• Monotone Operators and the Proximal Point Algorithm
• Engineering and Economic Applications of Complementarity Problems
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Convex programming in Hilbert space
• Tangent projection equations and general variational inequalities
• A new accuracy criterion for approximate proximal point algorithms
• Improvements of some projection methods for monotone nonlinear variational inequalities
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities

This page was built for publication: Inexact proximal point method for general variational inequalities