University of Cambridge > > Churchill CompSci Talks > "Programming" Problems

"Programming" Problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

Semidefinite Programming (SDP) is a mathematical technique that came into prominence in the late 1990s with the rise of Machine Learning. In fact, SDPs can be used for classification. In addition, SDPs represent a wide range of optimization problems from scheduling to maximal violations of quantum inequalities. This talk will explore the foundations of SDP in Linear Programming (LP) and some applications of LP. Then, the talk will continue onto SDPs and the landmark relaxation of the NP-Complete MAX -CUT problem that first demonstrated the power of SDPs. The talk will conclude with the links between LP, SDP , and other “programming” problems with respect to complexity.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2018, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity