from Part Four - Optimization
Published online by Cambridge University Press: 21 April 2022
This chapter examines an Lp-minimization program with interpolatory constraints as a way to introduce techniques commonly used in semidefinite programming. The case p = 2 reveals a link between positive semidefiniteness and Schur complements. The case p = ? illustrates the sum-of-squares techniques in connection with Riesz-Fejér theorem. The case p = 1 illustrates the method of moments in connection with the discrete trigonometric moment problem.
To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.