Skip to main content
Log in

Perfect duality in semi–infinite and semidefinite programming

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: November 10, 1997 / Accepted: March 5, 1999¶Published online May 3, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kortanek, K., Zhang, Q. Perfect duality in semi–infinite and semidefinite programming. Math. Program. 91, 127–144 (2001). https://doi.org/10.1007/s101070100232

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100232

Keywords

Navigation