A primal-dual algorithm framework for convex saddle-point optimization

In this study, we introduce a primal-dual prediction-correction algorithm framework for convex optimization problems with known saddle-point structure. Our unified frame adds the proximal term with a positive definite weighting matrix. Moreover, different proximal parameters in the frame can derive...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhang, Benxin, Zhu, Zhibin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2017
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5656743/
https://www.ncbi.nlm.nih.gov/pubmed/29104405
http://dx.doi.org/10.1186/s13660-017-1548-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5656743/
https://www.ncbi.nlm.nih.gov/pubmed/29104405
http://dx.doi.org/10.1186/s13660-017-1548-z

Ejemplares similares