Article Outline
Keywords
Duality of the Linear SIP Problem
Dual Semidefinite Programs
Perfect Duality from the View of Linear Semi-Infinite Programming
The SDP as a Conic Convex Program
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borwein JM, Wolkowicz H (1981) Characterizations of optimality for the abstract convex program with finite dimensional range. J Austral Math Soc (Ser A) 30:390–411
Borwein JM, Wolkowicz H (1981) Regularizing the abstract convex program. J Math Anal Appl 83:495–530
Charnes A, Cooper WW, Kortanek KO (1962) Duality, Haar programs and finite sequence spaces. Proc Nat Acad Sci USA 48:782–786
Charnes A, Cooper WW, Kortanek KO (1962) A duality theory for convex programs with convex constraints. Bull Amer Math Soc 68:605–608
Charnes A, Cooper WW, Kortanek KO (1963) Duality in semi-infinite programs and some works of Haar and Caratheodory. Managem Sci 9:208–228
Charnes A, Cooper WW, Kortanek KO (1965) On representation of semi-infinite programs which have no duality gaps. Managem Sci 12:113–121
Fiacco AV, Kortanek KO (eds) (1983) Semi-infinite programming and applications. Lecture Notes Economics and Math Systems. Springer, Berlin
Gustafson SÅ, Kortanek KO (1983) Semi-infinite programming and applications. In: Bachem A, Grötschel M, Korte B (eds) Mathematical Programming the State of the Art Bonn 1982. Springer, Berlin, pp 132–157
Gustafson S-å, Kortanek KO, Rom WO (1970) Non-Chebysevian moment problems. SIAM J Numer Anal 7:335–342
Hettich R (ed) (1979) Semi-infinite programming. Lecture Notes Control Inform Systems. Springer, Berlin
Hettich R, Kortanek KO (1993) Semi-infinite programming: theory, methods, and applications. SIAM Rev 35:380–429
Kortanek KO (1976) Perfect duality in generalized linear programming. In: Prékopa A (ed) Proc. IX Internat. Symp. on Math. Program., North Holland and Publ. House Hungarian Acad. Sci., 43–58
Kortanek KO (1977) Constructing a perfect duality in infinite programming. Appl Math Optim 3:357–372
Kortanek KO, Zhang Qinghong (2001) Perfect duality in semi-infinite and semidefinite programming. Math Program 91 1(127–144
Luo Zhi-Quan, Sturm JF, Zhang Shuzhong (Apr. 1997) Duality results for conic convex programming. Techn. Report Econometric Inst. Erasmus Univ. 9719/A
Ramana MV (1997) An exact duality theory for semidefinite programming and its complexity implications. Math Program B 77:129–162, Semidefinite Programming, Edited by Michael Overton and Henry Wolkowitz.
Ramana MV, Tunçel L, Wolkowicz H (1997) Strong duality for semidefinite programming. SIAM J Optim 7:641–662
Sturm JF (Sept. 1997) Primal-dual interior point approach to semidefinite programming. PhD Thesis Erasmus Univ. Rotterdam, The Netherlands,), Tinbergen Inst. Res. Ser. vol 156, Thesis Publ., Amsterdam, The Netherlands, 1997.
Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38:49–95
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Kortanek, K.O., Zhang, Q. (2008). Semi-infinite Programming, Semidefinite Programming and Perfect Duality . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_590
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_590
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering