activity
20212025
most citedOn convergence of a -random coordinate constrained algorithm for non-convex problems

1 citations · 1 across the 6 of their papers we have counts for

collaborators

7 papers

quant-ph2025

A 0.8395-approximation algorithm for the EPR problem

Anuj Apte, Eunou Lee, Kunal Marwaha +3

We give an efficient 0.8395-approximation algorithm for the EPR Hamiltonian. Our improvement comes from a new nonlinear monogamy-of-entanglement bound on star graphs and a refined…

math.OC2025

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy

Lennart Sinjorgo, Renata Sotirov, Juan C. Vera

We consider the Lasserre hierarchy for computing bounds on the stability number of graphs. The semidefinite programs (SDPs) arising from this hierarchy involve large matrix variabl…

quant-ph2025

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs

Sander Gribling, Lennart Sinjorgo, Renata Sotirov

We study polynomial-time approximation algorithms for the Quantum Max-Cut (QMC) problem. Given an edge-weighted graph on n vertices, the QMC problem is to determine the largest…

math.OC2024

Cuts and semidefinite liftings for the complex cut polytope

Lennart Sinjorgo, Renata Sotirov, Miguel F. Anjos

We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices , where the elements of are th unit roots. These polytop…

math.OC2023

On solving the MAX-SAT using sum of squares

Lennart Sinjorgo, Renata Sotirov

We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well…

math.OC2022★ 1 cited

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…

math.CO2021

On the generalized -number and related problems for highly symmetric graphs

Lennart Sinjorgo, Renata Sotirov

This paper is an in-depth analysis of the generalized -number of a graph. The generalized -number, , serves as a bound for both the -multic…