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...
Huvudupphovsman: | Chuangchuang Sun |
---|---|
Materialtyp: | Artikel |
Språk: | English |
Publicerad: |
MDPI AG
2023-10-01
|
Serie: | Mathematics |
Ämnen: | |
Länkar: | https://www.mdpi.com/2227-7390/11/21/4413 |
Liknande verk
Liknande verk
-
An ADMM-based SQP method for separably smooth nonconvex optimization
av: Meixing Liu, et al.
Publicerad: (2020-03-01) -
Subsampling algorithms for semidefinite programming
av: Alexandre W. d'Aspremont
Publicerad: (2011-01-01) -
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
av: Qinghua Liu, et al.
Publicerad: (2019-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
av: Xiao-Bo Jin, et al.
Publicerad: (2018-12-01) -
Bounds on Linear PDEs via Semidefinite Optimization
av: Bertsimas, Dimitris J., et al.
Publicerad: (2003)