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)