An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm (Q2807288)
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: An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm |
scientific article; zbMATH DE number 6583131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm |
scientific article; zbMATH DE number 6583131 |
Statements
20 May 2016
0 references
nonsmooth optimization
0 references
convex optimization
0 references
BOSVS
0 references
ergodic convergence
0 references
saddle point problem
0 references
variational inequality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8886854
0 references
0.8801528
0 references
0.8768015
0 references
0.8727572
0 references
0.87203395
0 references
0.8713341
0 references
0.8711779
0 references
0.8694728
0 references
0.86700314
0 references
An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm (English)
0 references
