A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming
We investigate a class of challenging general semidefinite programming problems with extra nonconvex constraints such as matrix rank constraints. This problem has extensive applications, including combinatorial graph problems, such as MAX-CUT and community detection, reformulated as quadratic object...
Autore principale: | Chuangchuang Sun |
---|---|
Natura: | Articolo |
Lingua: | English |
Pubblicazione: |
MDPI AG
2023-10-01
|
Serie: | Mathematics |
Soggetti: | |
Accesso online: | https://www.mdpi.com/2227-7390/11/21/4413 |
Documenti analoghi
Documenti analoghi
-
An ADMM-based SQP method for separably smooth nonconvex optimization
di: Meixing Liu, et al.
Pubblicazione: (2020-03-01) -
Subsampling algorithms for semidefinite programming
di: Alexandre W. d'Aspremont
Pubblicazione: (2011-01-01) -
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
di: Qinghua Liu, et al.
Pubblicazione: (2019-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
di: Xiao-Bo Jin, et al.
Pubblicazione: (2018-12-01) -
Bounds on Linear PDEs via Semidefinite Optimization
di: Bertsimas, Dimitris J., et al.
Pubblicazione: (2003)