Towards Hardware Acceleration of Semi-Definite Programming (SDP) Solver targeting Sum Of Squares (SOS) Optimization Problem

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

• Abid Rafique (Imperial College)
• Monday 04 October 2010, 13:00-14:00
• Level 9 Mahanakorn Lab., EE Dept..

If you have a question about this talk, please contact George A Constantinides.

In semi-definite programming (SDP), one minimizes a linear function subject to the constraint that the affine combination of symmetric matrices is positive semi-definite. Such a constraint is nonlinear and non smooth, but convex, therefore semi-definite programs are convex optimization problems. A very interesting application of SDP is solving sum of squares (SOS) optimization problem which has wide applications in system and control theory, combinatorial optimization and real algebraic geometry. In this talk, a framework is presented for solving the NP-hard problem of finding the global minimum of a polynomial using SOS relaxations and further by SDP formulation. Some existing results are presented demanding hardware acceleration of such a framework.

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Level 9 Mahanakorn Lab., EE Dept.

Note that ex-directory lists are not shown.