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...
Үндсэн зохиолч: | Chuangchuang Sun |
---|---|
Формат: | Өгүүллэг |
Хэл сонгох: | English |
Хэвлэсэн: |
MDPI AG
2023-10-01
|
Цуврал: | Mathematics |
Нөхцлүүд: | |
Онлайн хандалт: | https://www.mdpi.com/2227-7390/11/21/4413 |
Ижил төстэй зүйлс
-
An ADMM-based SQP method for separably smooth nonconvex optimization
-н: Meixing Liu, зэрэг
Хэвлэсэн: (2020-03-01) -
Subsampling algorithms for semidefinite programming
-н: Alexandre W. d'Aspremont
Хэвлэсэн: (2011-01-01) -
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
-н: Qinghua Liu, зэрэг
Хэвлэсэн: (2019-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
-н: Xiao-Bo Jin, зэрэг
Хэвлэсэн: (2018-12-01) -
Bounds on Linear PDEs via Semidefinite Optimization
-н: Bertsimas, Dimitris J., зэрэг
Хэвлэсэн: (2003)