Applications of semidefinite programming

Applied Numerical Mathematics

Volumn 29, Issue 3, 1999, Pages 283-299

  Vandenberghe, Lieven ^a   Boyd, Stephen ^b  

^a Engineering IV   (United States)

^b Stanford University   (United States)

Author keywords

Determinant maximization; Ellipsoidal approximation; Linear matrix inequalities; Optimization; Semidefinite programming

Indexed keywords

EID: 0039253032     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00098-1     Document Type: Article

References (39)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1) (1995) 13-51.
2. F. Alizadeh, J.P. Haeberly, M.V. Nayakkankuppam and M.L. Overton, SDPPACK User's Guide, Version 0.8 Beta (New York University Press, New York, June 1997).
3. A.C. Atkinson and A.N. Donev, Optimum Experiment Designs, Oxford Statistical Science Series (Oxford University Press, Oxford, 1992).
4. E.R. Barnes, An algorithm for separating patterns by ellipsoids, IBM J. Res. Develop. 26 (1982) 759-764.
5. A. Ben-Tal and A. Nemirovskii, Interior point polynomial time method for truss topology design, Technical Report 3/92, Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology (June 1992).
6. A. Ben-Tal and A. Nemirovski, Robust truss topology design via semidefinite programming, Technical Report 4/95, Optimization Laboratory, Faculty of Industrial Engineering, Technion, Israel Institute of Technology (August 1995).
7. A. Ben-Tal and A. Nemirovski, Optimal design of engineering structures, Optima (1995) 4-9.
8. D. Bertsimas, The achievable region method in the optimal control of queuing systems; formulations, bounds and policies, Queueing Systems Theory Appl. 21 (1995) 337-389.
9. B. Borchers, CSDP, A C Library for Semidefinite Programming (New Mexico Tech, 1997).
10. S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, Studies in Applied Mathematics, Vol. 15 (SIAM, Philadelphia, PA, 1994).
11. N. Brixius, F.A. Potra and R. Sheng, Solving semidefinite programs with Mathematica, Technical Report 97/1996, Department of Mathematics, University of Iowa (1996).
12. R.H. Byrd and J. Nocedal, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM J. Numer. Anal. (1989) 727-739.
13. F.L. Chernousko, State Estimation for Dynamic Systems (CRC Press, Boca Raton, FL, 1994).
14. G. Dahlquist, S.C. Eisenstat and G.H. Golub, Bounds for the error of linear systems of equations using the theory of moments, J. Math. Anal. Appl. 37 (1972) 151-166.
15. L. Danzer, B. Grunbaum and V. Klee, Helly's theorem and its relatives, in: V.L. Klee, ed., Convexity, Proceedings of Symposia in Pure Mathematics, Vol. 7 (Amer. Math. Soc., Providence, RI, 1963) 101-180.
16. J.E. Dennis and H. Wolkowicz, Sizing and least change secant methods, Technical Report CORR 90-02, Department of Combinatorics and Optimization, University of Waterloo (1993).
17. L. El Ghaoui, R. Nikoukha and F. Delebecque, LMITOOL: A Front-End for LMI Optimization, User's Guide (1995). Available via anonymous ftp to ftp.ensta.fr under /pub/elghaoui/lmitool.
18. V.V. Fedorov, Theory of Optimal Experiments (Academic Press, New York, 1971).
19. R. Fletcher, A new variational result for quasi-Newton formulae, SIAM J. Optim. (1991) 18-21.
20. K. Fujisawa and M. Kojima, SDPA (semidefinite programming algorithm) user's manual, Technical Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (1995).
21. P. Gahinet, A. Nemirovski, A.J. Laub and M. Chilali, LMI Control Toolbox (The Math Works, Inc., 1995).
22. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, Vol. 2 (Springer, Berlin, 1988).
23. F. John, Extremum problems with inequalities as subsidiary conditions, in: J. Moser, ed., Fritz John, Collected Papers (Birkhäuser, Boston, MA, 1985) 543-560.
24. S. Karlin and W.J. Studden, Tchebycheff Systems: With Applications in Analysis and Statistics (Wiley-Interscience, New York, 1966).
25. M.G. Krein and A.A. Nudelman, The Markov Moment Problem and Extremal Problems, Translations of Mathematical Monographs, Vol. 50 (Amer. Math. Soc., Providence, RI, 1977).
26. A.S. Lewis and M.L. Overton, Eigenvalue optimization, Acta Numer. (1996) 149-190.
27. Yu. Nesterov and A. Nemirovsky, Interior-Point Polynomial Methods in Convex Programming, Studies in Applied Mathematics, Vol. 13 (SIAM, Philadelphia, PA, 1994).
28. F. Pukelsheim, Optimal Design of Experiments (Wiley, New York, 1993).
29. J.B. Rosen, Pattern separation by convex programming, J. Math. Anal. Appl. 10 (1965) 123-134.
30. P.J. Rousseeuw and A.M. Leroy, Robust Regression and Outlier Detection (Wiley, New York, 1987).
31. E. Schwerer, A linear programming approach to the steady-state analysis of Markov processes, Ph.D. Thesis, Graduate School of Business, Stanford University, Draft (1996).
32. J. Sturm, SEDUMI Version 1.02, McMaster University (1998).
33. K.C. Toh, M.J. Todd and R.H. Tütüncü, SDPT3: A MATLAB Software Package for Semidefinite Programming (1996). Available at http://www.math.nus.sg/~mattohkc/index.html.
34. L. Vandenberghe and S. Boyd, SP: Software for Semidefinite Programming. User's Guide, Beta Version, Stanford University (October 1994). Available at http://www-isl.stanford.edu/people/boyd.
35. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev. 38 (1) (1996) 49-95.
36. L. Vandenberghe, S. Boyd and A. El Gamal, Optimal wire and transistor sizing for circuits with non-tree topology, in: Proceedings 1997 IEEE/ACM International Conference on Computer Aided Design (1997) 252-259.
37. L. Vandenberghe, S. Boyd and A. El Gamal, Optimizing dominant time constant in RC circuits, IEEE Trans. Comput.-Aided Design 2 (2) (1998) 110-125.
38. L. Vandenberghe, S. Boyd and S.-P. Wu, Determinant maximization with linear matrix inequality constraints, SIAM J. Matrix Anal. Appl. 19 (2) (1998) 499-533.
39. S.-P. Wu and S. Boyd, SDPSOL: A Parser/Solver for Semidefinite Programming and Determinant Maximization Problems with Matrix Structure. User's Guide, Version Beta, Stanford University (June 1996).