Search Results - semidefinite programming (SDP) with diagonal constraints

Distributed Synchronous and Asynchronous Algorithms for Semidefinite Programming With Diagonal Constraints by Jiang, Xia, Zeng, Xianlin, Sun, Jian, Chen, Jie

“…This article develops distributed synchronous and asynchronous algorithms for the large-scale semidefinite programming with diagonal constraints, which has wide applications in combinatorial…”
Get full text

Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs by Erdogdu, Murat A., Ozdaglar, Asuman, Parrilo, Pablo A., Vanli, Nuri Denizcan

“…Semidefinite programming (SDP) with diagonal constraints arise in many optimization problems, such as Max-Cut, community detection and group synchronization…”
Get full text

Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs by Erdogdu, Murat A, Ozdaglar, Asuman, Parrilo, Pablo A, Vanli, Nuri Denizcan

“…Semidefinite programming (SDP) with diagonal constraints arise in many optimization problems, such as Max-Cut, community detection and group synchronization…”
Get full text

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization by Marumo, Hiroki, Kim, Sunyoung, Yamashita, Makoto

“…We study T-semidefinite programming (SDP) relaxation for constrained polynomial optimization problems (POPs…”
Get full text

Fast SDP Relaxation of the Optimal Power Flow Using the Line-Wise Model for Representing Meshed Transmission Networks by Aldik, Abdel Rahman, Venkatesh, Bala

“…In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem…”
Get full text

Exact SDP relaxations of quadratically constrained quadratic programs with forest structures by Azuma, Godai, Fukuda, Mituhiro, Kim, Sunyoung, Yamashita, Makoto

“…We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs…”
Get full text

Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations by Kim, Sunyoung, Kojima, Masakazu

“…We show that SDP (semidefinite programming) and SOCP (second order cone programming…”
Get full text

Complexity of chordal conversion for sparse semidefinite programs with small treewidth by Zhang, Richard Y.

“…If a sparse semidefinite program (SDP), specified over n×n matrices and subject to m linear constraints, has an aggregate sparsity graph G with small treewidth…”
Get full text

Burer-Monteiro ADMM for Large-scale Diagonally Constrained SDPs by Chen, Yuwen, Goulart, Paul

“… Our approach is able to solve a class of large-scale SDPs with diagonal constraints. We prove that our ADMM algorithm converges globally to the set of first-order…”
Get full text

Complexity of chordal conversion for sparse semidefinite programs with small treewidth: Complexity of chordal conversion for sparse semidefinite by Zhang, Richard Y.

“…If a sparse semidefinite program (SDP), specified over n × n matrices and subject to m linear constraints, has an aggregate sparsity graph G with small…”
Get full text

Burer-Monteiro ADMM for Large-scale SDPs by Chen, Yuwen, Goulart, Paul

“… Our approach is able to solve a class of large-scale SDPs with diagonal constraints. We prove that our ADMM algorithm converges globally to a first-order stationary point…”
Get full text

Robust Superimposed Training Designs for MIMO Relaying Systems Under General Power Constraints by Rong, Beini, Zhang, Zhongshan, Zhao, Xin, Yu, Xiaoyun

“… In order to effectively address this problem, we propose an iterative semidefinite programming (SDP…”
Get full text

Faster, but weaker, relaxations for quadratically constrained quadratic programs by Burer, Samuel, Kim, Sunyoung, Kojima, Masakazu

“…). In contrast to existing relaxations based on semidefinite programming (SDP), our relaxations incorporate features of both SDP and second order cone programming (SOCP…”
Get full text

Asymptotic behavior of the central path for a special class of degenerate SDP problems by Neto, João X. da Cruz, Ferreira, Orizon P., Monteiro, Renato D. C.

“…This paper studies the asymptotic behavior of the central path (X(), S(), y()) as 0 for a class of degenerate semidefinite programming (SDP…”
Get full text

Exact SDP relaxations of quadratically constrained quadratic programs with forest structures by Azuma, Godai, Fukuda, Mituhiro, Kim, Sunyoung, Yamashita, Makoto

“…We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs…”
Get full text

On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension by Fernando Mario de Oliveira Filho, Frank Vallentin

“…On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension, Discrete Analysis 2020:10, 17 pp…”
Get full text

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization by Marumo, Hiroki, Kim, Sunyoung, Yamashita, Makoto

“…We study T-semidefinite programming (SDP) relaxation for constrained polynomial optimization problems (POPs…”
Get full text

Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation by Tseng, Paul

“…We study approximation bounds for the semidefinite programming (SDP) relaxation ofquadratically constrained quadratic optimization: $\min f^0(x)$ subject to $f^k(x)\le 0$, $k=1,\dots,m$, where fk(x)=xTAkx+(bk)Tx+ck…”
Get full text

Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem by Cutajar, Stefan, Smigoc, Helena, O'Hagan, Adrian

“… (not positive semidefinite). This can prove problematic in using the matrix in statistical models…”
Get full text

Fast ADMM for Sum-of-Squares Programs Using Partial Orthogonality by Zheng, Yang, Fantuzzi, Giovanni, Papachristodoulou, Antonis

“…When sum-of-squares (SOS) programs are recast as semidefinite programs (SDPs) using the standard monomial basis, the constraint matrices in the SDP possess a structural property that we call partial orthogonality…”
Get full text