Abstract
For a given solution to a semidefinite programming problem, it is easy to check its feasibility and to calculate the amount of constraint violation. But how do you check optimality or near optimality in terms of the objective value? Duality theory provides an answer to these questions. The idea is to associate the semidefinite program with a dual semidefinite program in such a way that upper and lower bounds on the optimal value can be calculated, once feasible solutions to the SDP problem and its dual are known.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Frenk, H., Roos, K., Terlaky, T., Zhang, S. (2000). Duality. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds) High Performance Optimization. Applied Optimization, vol 33. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3216-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3216-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4819-9
Online ISBN: 978-1-4757-3216-0
eBook Packages: Springer Book Archive