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)