New approach to relaxed proximal point algorithms based on \(A\)-maximal monotonicity frameworks and applications (Q2850042)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New approach to relaxed proximal point algorithms based on \(A\)-maximal monotonicity frameworks and applications |
scientific article; zbMATH DE number 6212298
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approach to relaxed proximal point algorithms based on \(A\)-maximal monotonicity frameworks and applications |
scientific article; zbMATH DE number 6212298 |
Statements
26 September 2013
0 references
generalized resolvent operator
0 references
maximal monotone mapping
0 references
proximal point algorithm
0 references
variational inclusion
0 references
0.9347154
0 references
0.92597234
0 references
0.9196474
0 references
0.91653544
0 references
0 references
0.90833354
0 references
0.90766597
0 references
0.9066834
0 references
New approach to relaxed proximal point algorithms based on \(A\)-maximal monotonicity frameworks and applications (English)
0 references
The authors propose and analyze a proximal-type algorithm for solving a class of inclusion problems in Hilbert space which involve certain nonlinear set-valued operators of monotone type. They establish linear convergence of the sequence generated by their algorithm and provide a convergence rate estimate.
0 references
