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...
Glavni autor: | Chuangchuang Sun |
---|---|
Format: | Članak |
Jezik: | English |
Izdano: |
MDPI AG
2023-10-01
|
Serija: | Mathematics |
Teme: | |
Online pristup: | https://www.mdpi.com/2227-7390/11/21/4413 |
Slični predmeti
-
An ADMM-based SQP method for separably smooth nonconvex optimization
od: Meixing Liu, i dr.
Izdano: (2020-03-01) -
Subsampling algorithms for semidefinite programming
od: Alexandre W. d'Aspremont
Izdano: (2011-01-01) -
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
od: Qinghua Liu, i dr.
Izdano: (2019-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
od: Xiao-Bo Jin, i dr.
Izdano: (2018-12-01) -
Bounds on Linear PDEs via Semidefinite Optimization
od: Bertsimas, Dimitris J., i dr.
Izdano: (2003)