Loading...
Please wait, while we are loading the content...
Similar Documents
Convergence rate of a proximal multiplier algorithm for separable convex minimization
Content Provider | Semantic Scholar |
---|---|
Author | Sarmiento, Orlando Quiroz, Erik A. Papa Oliveira, P. Roberto |
Copyright Year | 2017 |
Abstract | AbstractIn this paper, we analyse the convergence rate of the proximal algorithm proposed by us in the article [A proximal multiplier method for separable convex minimization. Optimization. 2016; 65:501–537], which has been proposed to solve a separable convex minimization problem. We prove that, under mild assumptions, the primal-dual sequences of the algorithm converge linearly to the optimal solution for a class of proximal distances. |
Starting Page | 251 |
Ending Page | 270 |
Page Count | 20 |
File Format | PDF HTM / HTML |
DOI | 10.1080/02331934.2016.1261138 |
Alternate Webpage(s) | http://www.optimization-online.org/DB_FILE/2015/03/4819.pdf |
Alternate Webpage(s) | https://doi.org/10.1080/02331934.2016.1261138 |
Volume Number | 66 |
Language | English |
Access Restriction | Open |
Content Type | Text |
Resource Type | Article |