A tutorial on convex optimization II: Duality and interior point methods

Proceedings of the American Control Conference

Volumn 2006, Issue , 2006, Pages 686-696

  Hindi, Haitham ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DUALITY; INTERIOR POINT METHODS;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; PROBLEM SOLVING; REAL TIME SYSTEMS;

OPTIMIZATION;

EID: 34047217440     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty. Nonlinear Programming. Theory and Algorithms. John Wiley & Sons, second edition, 1993.
2. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics, 2001.
3. D. P. Bertsekas. Nonlinear Programming. Athena Scientific, 1999.
4. D. Bertsimas and J. N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1997.
5. S. Boyd and C. Barratt. Linear Controller Design: Limits of Performance. Prentice-Hall, 1991.
6. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. SIAM Review, 2003. Submitted.
7. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory. Society for Industrial and Applied Mathematics, 1994.
8. S.P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004. Material available at www.stanford.edu/~boyd.
9. D. Colleran, C. Portmann, A. Hassibi, C. Crusius, S. Mohan, T. Lee S. Boyd, and M. Hershenson. Optimization of phase-locked loop circuits via geometric programming. In Custom Integrated Circuits Conference (CICC), San Jose, California, September 2003.
10. M. A. Dahleh and I. J. Diaz-Bobillo. Control of Uncertain Systems: A Linear Programming Approach. Prentice-Hall, 1995.
11. J. W. Detnmel. Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics, 1997.
12. G. E. Dullerud and F. Paganini. A Course in Robust Control Theory: A Convex Approach. Springer, 2000.
13. G. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, second edition, 1989.
14. M. C. Grant, S. P. Boyd., and Y. Ye. CVX: Matlab Software for Disciplined Convex Programming, 2005. Available from www.stanford.edu/~boyd/ cvx/.
15. M. Grötschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.
16. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Data Mining, Inference, and Prediction. Springer, 2001.
17. M. del Mar Hershenson, S. P. Boyd, and T. H. Lee. Optimal design of a CMOS op-amp via geometric programming. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20(1): 1-21, 2001.
18. H. Hindi. A tutorial on convex optimization. In American Control Conference, Boston, USA, June 2004.
19. J.-B. Hiriart-Urruty and C. Lemaréchal. Fundamentals of Convex Analysis. Springer, 2001. Abridged version of Convex Analysis and Minimization Algorithms volumes 1 and 2.
20. R. A. Horn and C. A. Johnson. Matrix Analysis. Cambridge University Press, 1985.
21. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-395, 1984.
22. J. Löfberg. YALMIP: a MATLAB toolbox for rapid prototyping of optimization problems. Version 3, 2005. Available from http://control.ee. ethz.ch/~joloef/yalmip.msql.
23. D. G. Luenberger. Optimization by Vector Space Methods. John Wiley & Sons, 1969.
24. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, second edition, 1984.
25. Z.-Q. Luo. Applications of convex optimization in signal processing and digital communication. Mathematical Programming Series B, 97:177-207, 2003.
26. O. Mangasarian. Nonlinear Programming. Society for Industrial and Applied Mathematics, 1994. First published in 1969 by McGraw-Hill.
27. Y. Nesterov and A. Nemirovskii. Interior-Point Polynomial Methods in Convex Programming. Society for Industrial and Applied Mathematics, 1994.
28. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
29. G. Strang. Linear Algebra and its Applications. Academic Press, 1980.
30. J. van Tiel. Convex Analysis. An Introductory Text. John Wiley & Sons, 1984.
31. H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of Semidefinite Programming. Kluwer Academic Publishers, 2000.
32. S. J. Wright. Primal-Dual Interior-Point Methods. Society for Industrial and Applied Mathematics, 1997.
33. Y. Ye. Interior Point Algorithms. Theory and Analysis. John Wiley & Sons, 1997.