Journal article
Perfect duality in semi-infinite and semidefinite programming
Mathematical programming, Vol.91(1), pp.127-144
10/01/2001
DOI: 10.1007/s101070100232
Abstract
This paper develops new relationships between the recently constructed semidefinite programming perfect duality and the earlier perfect duality achieved for linear semi–infinite programming. Applying the linear semi–infinite perfect duality construction to semidefinite programming yields a larger feasible set than the one obtained by the newly constructed semidefinite programming regularized perfect dual.
Details
- Title: Subtitle
- Perfect duality in semi-infinite and semidefinite programming
- Creators
- K. O. Kortanek - Department of Management Sciences, College of Business Administration, University of Iowa, United StatesQ. Zhang - Program in Applied Mathematical and Computational Sciences, University of Iowa, United States
- Resource Type
- Journal article
- Publication Details
- Mathematical programming, Vol.91(1), pp.127-144
- DOI
- 10.1007/s101070100232
- ISSN
- 0025-5610
- eISSN
- 1436-4646
- Number of pages
- 18
- Language
- English
- Date published
- 10/01/2001
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963105802771
Metrics
1 Record Views