Convergence of a proximal point algorithm for solving minimization problems (Q442796)
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 6063314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of a proximal point algorithm for solving minimization problems |
scientific article; zbMATH DE number 6063314 |
Statements
Convergence of a proximal point algorithm for solving minimization problems (English)
0 references
6 August 2012
0 references
Summary: We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradient iterative scheme. We prove the convergence rate of this new proximal point method under mild assumptions. Furthermore, it is shown that this estimate rate is better than the available ones.
0 references
proximal point algorithm
0 references
technique of Güler
0 references
convex nonquadratic distance-like functions
0 references
0 references
0.8344444036483765
0 references
0.8328880071640015
0 references
0.8302170634269714
0 references
0.8179007768630981
0 references
