09.07.2015 Views

Semidefinite Programming Relaxation vs Polyhedral Homotopy ...

Semidefinite Programming Relaxation vs Polyhedral Homotopy ...

Semidefinite Programming Relaxation vs Polyhedral Homotopy ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Systems of polynomial equationsIs the (sparse) SDP relaxation useful to solve systems ofpolynomial equations?The answer depends on:how sparse the system of polynomial equations is,the maximum degree of polynomials.2 types of systems of polynomial equations(a) Benchmark test problems from Verschelde’s homepage;Katsura, cyclic — not c-sparse(b) Systems of polynomials arising from discretization of anODE and a DAE (Differential Algebraic Equations)— c-sparseWorkshop on Advances in Optimization, April 19-21, 2007 – p.12/24

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!