A relaxed approximate proximal point algorithm
type: Item
instance of: scholarly article
title: A relaxed approximate proximal point algorithm
zbMATH Open document ID: 1119.90063
published in: Annals of Operations Research
publication date: 2005-04-22T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 47H05
Mathematics Subject Classification ID: 47J20
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 65J20
zbMATH DE Number: 2160536
zbMATH Keywords: proximal point algorithms
zbMATH Keywords: monotone operators
zbMATH Keywords: inexact
zbMATH Keywords: relaxation
author: Zhenhua Yang
author: Bingsheng He
MaRDI profile type: Publication
full work available at URL: s10479-004-5027-9
OpenAlex ID: W2044249951
cites work: Q5665783
cites work: Enlargement of monotone operators with applications to variational inequalities
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Approximate iterations in Bregman-function-based proximal algorithms
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Q3321366
cites work: A new accuracy criterion for approximate proximal point algorithms
cites work: Inexact implicit methods for monotone general variational inequalities
cites work: Multiplier and gradient methods
cites work: Monotone Operators and the Proximal Point Algorithm
DOI: 10.1007/S10479-004-5027-9
description: scientific article; zbMATH DE number 2160536