A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (Q1021801)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5563100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems |
scientific article; zbMATH DE number 5563100 |
Statements
A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (English)
0 references
9 June 2009
0 references
Using the concept of \(A\)-monotonicity in a Hilbert space, the author applies the generalized over-relaxed A-proximal point algorithm to approximate the solution of the following inclusion problem: Find \(x\) such that \(0\in Mx\). As a result, linear convergence of the resulting method is established under standard assumptions.
0 references
variational inclusions
0 references
maximal monotone mapping
0 references
\(A\)-maximal monotone mapping
0 references
generalized resolvent operator
0 references
over-relaxed \(A\)-proximal point algorithm
0 references
0 references
0 references
0 references
0.9221383929252625
0 references
0.8880849480628967
0 references
0.8829388618469238
0 references
