Connections Between Duality in Control Theory andConvex

@inproceedings{Balakrishnan1995ConnectionsBD,
  title={Connections Between Duality in Control Theory andConvex},
  author={OptimizationV. Balakrishnan and Lieven Vandenberghe},
  year={1995}
}
Several important problems in control theory can be reformulated as convex optimization problems. From duality theory in convex optimization, dual problems can be derived for these convex optimization problems. These dual problems can in turn be reinter-preted in control or system theoretic terms, often yielding new results or new proofs for existing results from control theory. Moreover, the most eecient algorithms for convex optimization solve the primal and dual problems simultaneously… CONTINUE READING

From This Paper

Topics from this paper.
5 Citations
7 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Interior-point polynomial methods in convex programming, volume 13 of Studies in Applied Mathematics

  • Yu. Nesterov, A. Nemirovsky
  • 1994
2 Excerpts

Semide nite pro- gramming

  • L. Vandenberghe, S. Boyd
  • Submitted to SIAM Review,
  • 1994
2 Excerpts

Convex Analysis and Minimization Algorithms II: Advanced The- ory and Bundle Methods, volume 306 of Grundlehren der mathematischen Wissenschaften

  • J.-B. Hiriart-Urruty, C. Lemar echal
  • 1993
1 Excerpt

Least squares stationary optimal control and the algebraic Riccati equation

  • J. C. Willems
  • IEEE Trans. Aut. Control,
  • 1971

Similar Papers

Loading similar papers…