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 |
Θέματα: | |
Διαθέσιμο Online: | 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)