Semidefinite programming

68Citations
Citations of this article
695Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to its many applications in control theory, robust optimization, combinatorial optimization and eigenvalue optimization, semidefinite programming had been in widespread use even before the development of efficient algorithms brought it into the realm of tractability. Today it is one of the basic modeling and optimization tools along with linear and quadratic programming. Our survey is an introduction to semidefinite programming, its duality and complexity theory, its applications and algorithms. © 2002 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Helmberg, C. (2002). Semidefinite programming. European Journal of Operational Research, 137(3), 461–482. https://doi.org/10.1016/S0377-2217(01)00143-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free