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...
1. Verfasser: | Chuangchuang Sun |
---|---|
Format: | Artikel |
Sprache: | English |
Veröffentlicht: |
MDPI AG
2023-10-01
|
Schriftenreihe: | Mathematics |
Schlagworte: | |
Online Zugang: | https://www.mdpi.com/2227-7390/11/21/4413 |
Ähnliche Einträge
Ähnliche Einträge
-
An ADMM-based SQP method for separably smooth nonconvex optimization
von: Meixing Liu, et al.
Veröffentlicht: (2020-03-01) -
Subsampling algorithms for semidefinite programming
von: Alexandre W. d'Aspremont
Veröffentlicht: (2011-01-01) -
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
von: Qinghua Liu, et al.
Veröffentlicht: (2019-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
von: Xiao-Bo Jin, et al.
Veröffentlicht: (2018-12-01) -
Bounds on Linear PDEs via Semidefinite Optimization
von: Bertsimas, Dimitris J., et al.
Veröffentlicht: (2003)