Showing math.OCShow all
2 papers · 1 filter
math.OC2023
Semidefinite Programming by Projective Cutting Planes
Daniel Porumbel
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polyno…
math.OC2022
Demystifying the characterization of SDP matrices in mathematical programming
Daniel Porumbel
This manuscript was written because I found no other introduction to SDP programming that targets the same audience. A first difference compared to other existing introductions to…