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...
Main Author: | Chuangchuang Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/21/4413 |
Similar Items
-
An ADMM-based SQP method for separably smooth nonconvex optimization
by: Meixing Liu, et al.
Published: (2020-03-01) -
Subsampling algorithms for semidefinite programming
by: Alexandre W. d'Aspremont
Published: (2011-01-01) -
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
by: Qinghua Liu, et al.
Published: (2019-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
by: Xiao-Bo Jin, et al.
Published: (2018-12-01) -
Bounds on Linear PDEs via Semidefinite Optimization
by: Bertsimas, Dimitris J., et al.
Published: (2003)