Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2020 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 |
Publisher | Association for Computing Machinery |
Pages | 92-97 |
Number of pages | 6 |
ISBN (Electronic) | 9781450377485 |
DOIs | |
State | Published - 28 May 2020 |
Event | 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 - Chengdu, China Duration: 28 May 2020 → 30 May 2020 |
Publication series
Name | ACM International Conference Proceeding Series |
---|
Conference
Conference | 5th International Conference on Multimedia Systems and Signal Processing, ICMSSP 2020 |
---|---|
Country/Territory | China |
City | Chengdu |
Period | 28/05/20 → 30/05/20 |
Bibliographical note
Publisher Copyright:© 2020 ACM.
Keywords
- Descomposition method
- Euclidean Jordan algebra
- Proximal distance
- Symmetric cone optimization