Max-cut problem is one of many NP-hard graph theory problems which attracted many researchers over the years. Maximum cuts are useful items including theoretical physics and electronics. But they are ...

This framework recently led to many breakthroughs on decade-old optimization problems. ... focusing on faster algorithms for linear programming and semidefinite programming. We will first present how ...

In this paper we introduce new semidefinite programming relaxations to box-constrained polynomial optimization programs (P). For this, we first reformulate (P) into a quadratic program. More precisely ...

Linear and Semidefinite programs provide the best approximation algorithms for many NP-hard combinatorial optimization problems. This talk will introduce recent techniques to give unconditional lower ...

In this work, we solve an optimal resource allocation problem for controlling an epidemic outbreak using the SIS epidemic model. Semidefinite and geometric programming approaches are considered for ...

Course Description. This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; ...