"Programming" Problems

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

• Bingjie Wang, Churchill College
• Wednesday 12 November 2014, 19:40-20:30
• Wolfson Hall, Churchill College.

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.

This talk is included in these lists:

• Churchill CompSci Talks
• Wolfson Hall, Churchill College
• computer science
• se393's list

Note that ex-directory lists are not shown.