A clique graph based merging strategy for decomposable SDPs

A clique graph based merging strategy for decomposable SDPs

Chordal decomposition techniques are used to reduce large structured positive semidefinite matrix constraints in semidefinite programs (SDPs). The resulting equivalent problem contains multiple smaller constraints on the nonzero blocks (or cliques) of the original problem matrices. This usually lead...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Garstka, M, Cannon, M, Goulart, P
Formáid:	Conference item
Teanga:	English
Foilsithe / Cruthaithe:	Elsevier 2021

Míreanna comhchosúla

Chordal sparsity, decomposing SDPs and the Lyapunov equation
de réir: Mason, R, et al.
Foilsithe / Cruthaithe: (2014)

Burer-Monteiro ADMM for large-scale SDPs
de réir: Chen, Y, et al.
Foilsithe / Cruthaithe: (2023)

Fast ADMM for homogeneous self-dual embeddings of sparse SDPs
de réir: Zheng, Y, et al.
Foilsithe / Cruthaithe: (2016)

On clique convergence of graphs
de réir: S.M. Hegde, et al.
Foilsithe / Cruthaithe: (2016-12-01)

Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
de réir: Napur Patra, et al.
Foilsithe / Cruthaithe: (2021-06-01)

Finding sparse, equivalent SDPs using minimal coordinate projections
de réir: Permenter, Frank Noble, et al.
Foilsithe / Cruthaithe: (2019)

on the number of cliques and cycles in graphs
de réir: Mojgan Emami, et al.
Foilsithe / Cruthaithe: (2013-06-01)

Inverse Clique Domination in Graphs
de réir: Carmelita Loquias, et al.
Foilsithe / Cruthaithe: (2016-12-01)

More Revenue from Two Samples via Factor Revealing SDPs
de réir: Daskalakis, Constantinos, et al.
Foilsithe / Cruthaithe: (2022)

Learning graph representations with maximal cliques
de réir: Molaei, S, et al.
Foilsithe / Cruthaithe: (2021)

Clique covers of H-free graphs
de réir: Nguyen, T, et al.
Foilsithe / Cruthaithe: (2023)

Clique colouring of binomial random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

A result on interated clique graphs /
de réir: 295030 Lim, Chong-Keong
Foilsithe / Cruthaithe: (1978)

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
de réir: Chuan-Min Lee
Foilsithe / Cruthaithe: (2021-01-01)

MotifClick: prediction of <it>cis</it>-regulatory binding sites via merging cliques
de réir: Su Zhengchang, et al.
Foilsithe / Cruthaithe: (2011-06-01)

Edge-regular graphs with regular cliques
de réir: Greaves, Gary Royden Watson, et al.
Foilsithe / Cruthaithe: (2019)

Cliques of Graph Convolutional Networks for Recommendation
de réir: Zhenye Pan, et al.
Foilsithe / Cruthaithe: (2024-01-01)

Complexity results on graphs with few cliques
de réir: Bill Rosgen, et al.
Foilsithe / Cruthaithe: (2007-01-01)

Largest cliques in connected supermagic graphs
de réir: Anna Lladó
Foilsithe / Cruthaithe: (2005-01-01)

Cliques Are Bricks for k-CT Graphs
de réir: Václav Snášel, et al.
Foilsithe / Cruthaithe: (2021-05-01)

Graph Planarity by Replacing Cliques with Paths
de réir: Patrizio Angelini, et al.
Foilsithe / Cruthaithe: (2020-08-01)

Complexity Results on Graphs with Few Cliques
de réir: Bill Rosgen, et al.
Foilsithe / Cruthaithe: (2007-01-01)

GraphZIP: a clique-based sparse graph compression method
de réir: Ryan A. Rossi, et al.
Foilsithe / Cruthaithe: (2018-03-01)

Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
de réir: Permenter, Frank Noble, et al.
Foilsithe / Cruthaithe: (2018)

On probe 2-clique graphs and probe diamond-free graphs
de réir: Flavia Bonomo, et al.
Foilsithe / Cruthaithe: (2015-03-01)

On the clique number of a strongly regular graph
de réir: Greaves, Gary Royden Watson, et al.
Foilsithe / Cruthaithe: (2021)

Number of Cliques in Graphs with a Forbidden Subdivision
de réir: Lee, Choongbum, et al.
Foilsithe / Cruthaithe: (2016)

Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs
de réir: Erdogdu, Murat A, et al.
Foilsithe / Cruthaithe: (2022)

Exploratory Data Analysis and Searching Cliques in Graphs
de réir: András Hubai, et al.
Foilsithe / Cruthaithe: (2024-03-01)

Independent sets in graphs with an excluded clique minor
de réir: David R. Wood
Foilsithe / Cruthaithe: (2007-01-01)

Clique cycle transversals in graphs with few P₄'s
de réir: Raquel Bravo, et al.
Foilsithe / Cruthaithe: (2013-09-01)

On graphs with equal coprime index and clique number
de réir: Chetan Patil, et al.
Foilsithe / Cruthaithe: (2023-09-01)

The DP Color Function of Clique-Gluings of Graphs
de réir: Hemanshu Kaul, et al.
Foilsithe / Cruthaithe: (2023-09-01)

Independent Sets in Graphs with an Excluded Clique Minor
de réir: David R. Wood
Foilsithe / Cruthaithe: (2007-01-01)

The clique number and some Hamiltonian properties of graphs
de réir: Rao Li
Foilsithe / Cruthaithe: (2021-08-01)

Bounds on the Clique and the Independence Number for Certain Classes of Graphs
de réir: Valentin E. Brimkov, et al.
Foilsithe / Cruthaithe: (2024-01-01)

On Bunjamin's algorithm for a largest clique in a graph /
de réir: 303533 Rathbone, C. R., et al.
Foilsithe / Cruthaithe: (1978)

A Note on the Signed Clique Domination Numbers of Graphs
de réir: Baogen Xu, et al.
Foilsithe / Cruthaithe: (2022-01-01)

A Spectral Characterization of the S-Clique Extension of the Triangular Graphs
de réir: Tan Ying-Ying, et al.
Foilsithe / Cruthaithe: (2020-05-01)

Chromatic and clique numbers of a class of perfect graphs
de réir: Mohammad Reza Fander
Foilsithe / Cruthaithe: (2015-12-01)