Resumen
This work is devoted to the study of a proximal decomposition algorithm for solving convex symmetric cone optimization with separable structures. The algorithm considered is based on a decomposition method and proximal distances. Under suitable assumptions, we prove that each limit point of the primal-dual sequences generated by the algorithm solves the problem. Finally, the global convergence is established.
Idioma original | Inglés |
---|---|
Título de la publicación alojada | Proceedings of the 2020 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 |
Editorial | Association for Computing Machinery |
Páginas | 92-97 |
Número de páginas | 6 |
ISBN (versión digital) | 9781450377485 |
DOI | |
Estado | Publicada - 28 may. 2020 |
Evento | 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 - Chengdu, China Duración: 28 may. 2020 → 30 may. 2020 |
Serie de la publicación
Nombre | ACM International Conference Proceeding Series |
---|
Conferencia
Conferencia | 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 |
---|---|
País/Territorio | China |
Ciudad | Chengdu |
Período | 28/05/20 → 30/05/20 |
Nota bibliográfica
Publisher Copyright:© 2020 ACM.