Cart (Loading....) | Create Account
Close category search window
 

Higher order semi-definite relaxations for quadratic programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Parrilo, P.A. ; Dept. of Control & Dynamical Syst., California Inst. of Technol., Pasadena, CA, USA

We present improved versions of the standard semi-definite relaxation for quadratic programming, that underlies many important results in robustness analysis and combinatorial optimization. It is shown that the proposed polynomial time convex conditions are at least as strong as the standard ones, and usually better, but at a higher computational cost. Several applications of the new relaxations are provided, including less conservative upper bounds for the structured singular value CL and enhanced solutions for the MAX CUT graph partitioning problem

Published in:

Decision and Control, 2000. Proceedings of the 39th IEEE Conference on  (Volume:5 )

Date of Conference:

2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.