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...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Garstka, M, Cannon, M, Goulart, P
Format:	Conference item
Sprog:	English
Udgivet:	Elsevier 2021

Lignende værker

Chordal sparsity, decomposing SDPs and the Lyapunov equation
af: Mason, R, et al.
Udgivet: (2014)

Burer-Monteiro ADMM for large-scale SDPs
af: Chen, Y, et al.
Udgivet: (2023)

Fast ADMM for homogeneous self-dual embeddings of sparse SDPs
af: Zheng, Y, et al.
Udgivet: (2016)

On clique convergence of graphs
af: S.M. Hegde, et al.
Udgivet: (2016-12-01)

Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
af: Napur Patra, et al.
Udgivet: (2021-06-01)

Finding sparse, equivalent SDPs using minimal coordinate projections
af: Permenter, Frank Noble, et al.
Udgivet: (2019)

on the number of cliques and cycles in graphs
af: Mojgan Emami, et al.
Udgivet: (2013-06-01)

Inverse Clique Domination in Graphs
af: Carmelita Loquias, et al.
Udgivet: (2016-12-01)

More Revenue from Two Samples via Factor Revealing SDPs
af: Daskalakis, Constantinos, et al.
Udgivet: (2022)

Learning graph representations with maximal cliques
af: Molaei, S, et al.
Udgivet: (2021)

Clique covers of H-free graphs
af: Nguyen, T, et al.
Udgivet: (2023)

Clique colouring of binomial random graphs
af: McDiarmid, C, et al.
Udgivet: (2018)

A result on interated clique graphs /
af: 295030 Lim, Chong-Keong
Udgivet: (1978)

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
af: Chuan-Min Lee
Udgivet: (2021-01-01)

MotifClick: prediction of <it>cis</it>-regulatory binding sites via merging cliques
af: Su Zhengchang, et al.
Udgivet: (2011-06-01)

Edge-regular graphs with regular cliques
af: Greaves, Gary Royden Watson, et al.
Udgivet: (2019)

Cliques of Graph Convolutional Networks for Recommendation
af: Zhenye Pan, et al.
Udgivet: (2024-01-01)

Complexity results on graphs with few cliques
af: Bill Rosgen, et al.
Udgivet: (2007-01-01)

Largest cliques in connected supermagic graphs
af: Anna Lladó
Udgivet: (2005-01-01)

Cliques Are Bricks for k-CT Graphs
af: Václav Snášel, et al.
Udgivet: (2021-05-01)

Graph Planarity by Replacing Cliques with Paths
af: Patrizio Angelini, et al.
Udgivet: (2020-08-01)

Complexity Results on Graphs with Few Cliques
af: Bill Rosgen, et al.
Udgivet: (2007-01-01)

GraphZIP: a clique-based sparse graph compression method
af: Ryan A. Rossi, et al.
Udgivet: (2018-03-01)

Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
af: Permenter, Frank Noble, et al.
Udgivet: (2018)

On probe 2-clique graphs and probe diamond-free graphs
af: Flavia Bonomo, et al.
Udgivet: (2015-03-01)

On the clique number of a strongly regular graph
af: Greaves, Gary Royden Watson, et al.
Udgivet: (2021)

Number of Cliques in Graphs with a Forbidden Subdivision
af: Lee, Choongbum, et al.
Udgivet: (2016)

Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs
af: Erdogdu, Murat A, et al.
Udgivet: (2022)

Exploratory Data Analysis and Searching Cliques in Graphs
af: András Hubai, et al.
Udgivet: (2024-03-01)

Independent sets in graphs with an excluded clique minor
af: David R. Wood
Udgivet: (2007-01-01)

Clique cycle transversals in graphs with few P₄'s
af: Raquel Bravo, et al.
Udgivet: (2013-09-01)

On graphs with equal coprime index and clique number
af: Chetan Patil, et al.
Udgivet: (2023-09-01)

The DP Color Function of Clique-Gluings of Graphs
af: Hemanshu Kaul, et al.
Udgivet: (2023-09-01)

Independent Sets in Graphs with an Excluded Clique Minor
af: David R. Wood
Udgivet: (2007-01-01)

The clique number and some Hamiltonian properties of graphs
af: Rao Li
Udgivet: (2021-08-01)

Bounds on the Clique and the Independence Number for Certain Classes of Graphs
af: Valentin E. Brimkov, et al.
Udgivet: (2024-01-01)

On Bunjamin's algorithm for a largest clique in a graph /
af: 303533 Rathbone, C. R., et al.
Udgivet: (1978)

A Note on the Signed Clique Domination Numbers of Graphs
af: Baogen Xu, et al.
Udgivet: (2022-01-01)

A Spectral Characterization of the S-Clique Extension of the Triangular Graphs
af: Tan Ying-Ying, et al.
Udgivet: (2020-05-01)

Chromatic and clique numbers of a class of perfect graphs
af: Mohammad Reza Fander
Udgivet: (2015-12-01)