A relaxed approximate proximal point algorithm

DOI10.1007/s10479-004-5027-9zbMath1119.90063OpenAlexW2044249951MaRDI QIDQ1772967

Zhen Hua Yang, Bing-sheng He

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-004-5027-9

zbMATH Keywords

inexactrelaxationmonotone operatorsproximal point algorithms

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items

Uniformity and inexact version of a proximal method for metrically regular mappings ⋮ The developments of proximal point algorithms ⋮ An approximate proximal point algorithm for maximal monotone inclusion problems ⋮ A modified proximal point algorithm with errors for approximating solution of the general variational inclusion ⋮ A Lyusternik-Graves theorem for the proximal point method ⋮ An algorithm for solving the general variational inclusion involving \(A\)-monotone operators ⋮ Stability analysis of Gauss-type proximal point method for metrically regular mappings ⋮ Approximation of Fixed Points of Metrically Regular Mappings ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ Weak convergence of a hybrid type method with errors for a maximal monotone mapping in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Approximate iterations in Bregman-function-based proximal algorithms
• Enlargement of monotone operators with applications to variational inequalities
• Inexact implicit methods for monotone general variational inequalities
• Multiplier and gradient methods
• 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
• A new accuracy criterion for approximate proximal point algorithms

This page was built for publication: A relaxed approximate proximal point algorithm