Semidefinite Programming Relaxations and Algebraic Optimization in Control

@article{Parrilo2003SemidefinitePR,
  title={Semidefinite Programming Relaxations and Algebraic Optimization in Control},
  author={Pablo A. Parrilo and Sanjay Lall},
  journal={Eur. J. Control},
  year={2003},
  volume={9},
  pages={307-321}
}
We present an overview of the essential elements of semidefinite programming as a computational tool for the analysis of systems and control problems. We make particular emphasis on general duality properties as providing suboptimality or infeasibility certificates. Our focus is on the exciting developments occurred in the last few years, including robust optimization, combinatorial optimization, and algebraic methods such as sum-of-squares. These developments are illustrated with examples of… CONTINUE READING
Highly Cited
This paper has 101 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
71 Citations
60 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 71 extracted citations

101 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 101 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 60 references

Computation of subsets of the domain of attraction for polynomial systems

  • B. Tibken, K. F. Dilaver
  • In Proceedings of the 41st IEEE Conference on…
  • 2002
1 Excerpt

Convex Optimization

  • S. Boyd, L. Vandenberghe
  • Preprint
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…