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 |
Предметы: | |
Online-ссылка: | 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)