42 citations · 144 across the 30 of their papers we have counts for
3 papers · 1 filter
On convergence of a -random coordinate constrained algorithm for non-convex problems
Alireza Ghaffari-Hadigheh, Lennart Sinjorgo, Renata Sotirov
We propose a random coordinate descent algorithm for optimizing a non-convex objective function subject to one linear constraint and simple bounds on the variables. Although it is…
Partitioning through projections: strong SDP bounds for large graph partition problems
Frank de Meijer, Renata Sotirov, Angelika Wiegele +1
The graph partition problem (GPP) aims at clustering the vertex set of a graph into a fixed number of disjoint subsets of given sizes such that the sum of weights of edges joining…
The Chvátal-Gomory Procedure for Integer SDPs with Applications in Combinatorial Optimization
Frank de Meijer, Renata Sotirov
In this paper we study the well-known Chvátal-Gomory (CG) procedure for the class of integer semidefinite programs (ISDPs). We prove several results regarding the hierarchy of rela…