A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems (Q1021801): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aml.2008.05.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972137641 / rank | |||
Normal rank | |||
Revision as of 00:19, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems |
scientific article |
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
