Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Lax conjecture solved

Abstract:
Lax conjecture solved. The Lax conjecture, an open problem of 45 years standing with important applications in optimization, fell in just a few weeks after the right connections were made at the March 2003 IMA workshop on Semidefinite Programming and Robust Optimization. Discussions between Adrian Lewis and Pablo Parrilo led them and coauthor M. Ramana to pursue connections with work of Helton and Vinnikov. Their joint paper, entitled ''The Lax Conjecture is True'' appeared on the arXiv preprint server on April 8, 2003 and has been submitted to the Proceedings of the American Mathematical Society.

IMA-news.pdf

Further Information
Date/Time:

Aug 21, 2003   
Contact Person:

Pablo A. Parrilo