Abstract
SUMMARYThis paper deals with convex relaxations for quadratic distance problems, a class of optimization problems relevant to several important topics in the analysis and synthesis of robust control systems. Some classes of convex relaxations are investigated using the sum of squares paradigm for the representation of positive polynomials. The main contribution is to show that two different relaxations, based respectively on the Positivstellensatz and on properties of homogeneous polynomial forms, are equivalent. Relationships among the considered relaxations are discussed and numerical comparisons are presented, highlighting their degree of conservatism. Copyright © 2012 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
