Cargando…
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
We consider both facial reduction, FR, and symmetry reduction, SR, techniques for semidefinite programming, SDP. We show that the two together fit surprisingly well in an alternating direction method of multipliers, ADMM, approach. In fact, this approach allows for simply adding on nonnegativity con...
Autores principales: | Hu, Hao, Sotirov, Renata, Wolkowicz, Henry |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10195748/ https://www.ncbi.nlm.nih.gov/pubmed/37215307 http://dx.doi.org/10.1007/s10107-022-01890-9 |
Ejemplares similares
-
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
por: Guo, Chuan-Hao, et al.
Publicado: (2019) -
Handbook of semidefinite programming: theory, algorithms, and applications
por: Wolkowicz, Henry, et al.
Publicado: (2000) -
Approximation Algorithms and Semidefinite Programming
por: Gärtner, Bernd, et al.
Publicado: (2012) -
Uniqueness of codes using semidefinite programming
por: Brouwer, Andries E., et al.
Publicado: (2018) -
Polyhedral and semidefinite programming methods in combinatorial optimization
por: Tunçel, Levent
Publicado: (2010)