Determinant maximization with linear matrix inequality constraints

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 2, 1998, Pages 499-533

  Vandenberghe, Lieven ^a   Boyd, Stephen ^b   Wu, Shao Po ^b  

^a University of California   (United States)

^b Stanford University   (United States)

Author keywords

Interior point methods; Linear matrix inequalities; Semidefinite programming

Indexed keywords

EID: 0032397913     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896303430     Document Type: Article

References (76)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. T. W. ANDERSON, Statistical inference for covariance matrices with linear structure, in Multivariate Analysis II. Proceedings of the Second International Symposium on Multivariate Analysis, P. R. Krishnaiah, ed., Academic Press, New York, 1969, pp. 55-66.
3. T. W. ANDERSON, Estimation of covariance matrices which are linear combinations or whose inverses are linear combinations of given matrices, in Essays in Probability and Statistics, R. C. Bose et al., eds., University of North Carolina Press, Chapel Hill, NC, 1970, pp. 1-24.
4. K. M. ANSTREICHER AND M. FAMPA. A Long-Step Path Following Algorithm for Semidefinite Programming Problems, Tech. report, Department of Management Sciences, University of Iowa, Iowa City, IA, 1996.
5. K. M. ANSTREICHER, M. FAMPA, J. LEE, AND J. WILLIAMS, Continuous relaxations for constrained maximum-entropy sampling, in Integer Programming and Combinatorial Optimization, W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds., Lecture Notes in Comput. Sci. 1084, Springer-Verlag, New York, 1996, pp. 234-248.
6. J. T. ASLANIS AND J. M. CIOFFI, Achievable information rates on digital subscriber loops: limiting information rates with crosstalk noise, IEEE Trans. Comm., 40 (1992), pp. 361-372.
7. A. C. ATKINSON AND A. N. DONEV, Optimum experiment designs, Oxford Statist. Sci. Ser., Oxford University Press, London, 1992.
8. M. BARONYI AND H. J. WOERDEMAN, Maximum entropy elements in the intersection of an affine space and the cone of positive definite matrices, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 360-376.
9. E. R. BARNES, An algorithm for separating patterns by ellipsoids, IBM J. Res. Develop., 26 (1982), pp. 759-764.
10. W. W. BARRETT, C. R. JOHNSON, AND M. LUNDQUIST, Determinantal formulation for matrix completions associated with chordal graphs, Linear Algebra Appl., 121 (1989), pp. 265-289.
11. D. BERTSEKAS AND I. RHODES, Recursive state estimation for a set-membership description of uncertainty, IEEE Trans. Automat. Control, AC-16 (1971), pp. 117-128.
12. S. BOYD AND L. EL GHAOUI, Method of centers for minimizing generalized eigenvalues, Linear Algebra Appl., 188 (1993), pp. 63-111.
13. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, Stud. Appl. Math. 15, SIAM, Philadelphia, PA, 1994.
14. S. BOYD AND L. VANDENBERGHE, Introduction to convex optimization with engineering applications, Lecture Notes, Information Systems Laboratory, Stanford University, Stanford, CA, 1995; available online from http://www-isl.stanford.edu/people/boyd/392/ ee392x.html.
15. J. P. BURG, D. G. LUENBERGER, AND D. L. WENGER, Estimation of structured covariance matrices, Proc. IEEE, 30 (1982), pp. 963-974.
16. F. L. CHERNOUSKO, Guaranteed estimates of undetermined quantities by means of ellipsoids, Soviet Math. Dokl., 21 (1980), pp. 396-399.
17. F. L. CHERNOUSKO, State Estimation for Dynamic Systems, CRC Press, Boca Raton, FL, 1994.
18. M. CHEUNG, S. YURKOVICH, AND K. M. PASSINO, An optimal volume ellipsoid algorithm for parameter estimation, IEEE Trans. Automat. Control, AC-38 (1993), pp. 1292-1296.
19. D. COOK AND V. FEDOROV, Constrained optimization of experimental design, Statistics, 26 (1995), pp. 129-178.
20. T. M. COVER AND S. POMBRA, Gaussian feedback capacity, IEEE Trans. Inform. Theory, 35 (1989), pp. 37-43.
21. T. M. COVER AND J. A. THOMAS, Elements of Information Theory, Wiley-Interscience, New York, 1991.
22. C. DAVIS, W. M. KAHAN, AND H. F. WEINBERGER, Norm-preserving dilations and their applications to optimal error bounds, SIAM J. Numer. Anal., 19 (1982), pp. 445-469.
23. J. DELLER, Set membership identification in digital signal processing, IEEE Trans. Acoustics, Speech and Signal Processing, 6 (1989), pp. 4-20.
24. J. R. DELLER, M. NAYERI, AND S. F. ODEH, Least-square identification with error bounds for real-time signal processing and control, Proc. IEEE, 81 (1993), pp. 815-849.
25. A. DEMBO, The relation between maximum likelihood estimation of structured covariance matrices and periodograms, IEEE Trans. Acoustics, Speech and Signal Processing, 34 (1986), pp. 1661-1662.
26. A. DEMBO, C. L. MALLOWS, AND L. A. SHEPP, Embedding nonnegative definite Toeplitz matrices in nonnegative definite circulant matrices, with application to covariance estimation, IEEE Trans. Inform. Theory, 35 (1989), pp. 1206-1212.
27. A. P. DEMPSTER, Covariance selection, Biometrics, 28 (1972), pp. 157-175.
28. D. DEN HERTOG, Interior Point Approach to Linear, Quadratic and Convex Programming, Kluwer Academic Publishers, Norwell, MA, 1993.
29. P. DEWILDE AND E. F. A. DEPRETTERE, The generalized Schur algorithm: approximations and hierarchy, in Topics in Operator Theory and Interpolation, I. Gohberg, ed., Birkhaüser-Verlag, Basel, Switzerland, 1988, pp. 97-116.
30. P. DEWILDE AND Z. Q. NING, Models for Large Integrated Circuits, Kluwer Academic Publishers, Norwell, MA, 1990.
31. H. DYM AND I. GOHBERG, Extensions of band matrices with band inverses, Linear Algebra Appl., 36 (1981), pp. 1-24.
32. L. EL GHAOUI, Robustness analysis of semidefinite programs and applications to matrix completion problems, presented at MTNS-90. St. Louis, MO, 1996.
33. V. V. FEDOROV, Theory of Optimal Experiments, Academic Press, New York 1971.
34. A. FIACCO AND G. MCCORMICK, Nonlinear programming: sequential unconstrained minimization techniques, Wiley, 1968; SIAM Philadelphia, PA, 1990.
35. E. FOGEL, System identification via membership set constraints with energy constrained noise, IEEE Trans. Automat. Control, AC-24 (1979), pp. 752-757.
36. E. FOGEL AND Y. HUANG, On the value of information in system identification-bounded noise case, Automatica, 18 (1982), pp. 229-238.
37. R. GRONE, C. R. JOHNSON, E. M. SÁ, AND H. WOLKOWICZ, Positive definite completions of partial Hermitian matrices, Linear Algebra Appl., 58 (1984), pp. 109-124.
38. J. W. HELTON AND H. J. WOERDEMAN, Symmetric Hankel operators: Minimal norm extensions and eigenstructures, Linear Algebra Appl., 185 (1993), pp. 1-19.
39. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms I, Grundlehren der mathematischen Wissenschaften 305, Springer-Verlag, New York, 1993.
40. G. B. JÁVORZKY, I. KOLLÁR, L. VANDENBERGHE, S. BOYD, AND S.-P. Wu, Optimal excitation signal design for frequency domain system identification using semidefinite programming, in Proc. 8th IMEKO TC4 Symposium on Recent Advances in Electrical Measurements, Budapest, Hungary, 1996, pp. 192-197.
41. C. R. JOHNSON, Positive definite completions: a guide to selected literature, in Signal Processing. Part I: Signal Processing Theory. L. Auslander, T. Kailath, and S. Mitter, eds., IMA Vol. Math. Appl., Springer, New York, 1990, pp. 169-188.
42. C. R. JOHNSON, B. KROSCHEL, AND H. WOLKOWICZ, An Interior-Point Method for Approximate Positive Semidefinite Completions, Tech. report CORR Report 95-11, University of Waterloo, Waterloo, ON, Canada, 1995; Comput. Optim. Appl., to appear.
43. L. G. KHACHIYAN AND M. J. TODD, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Math. Programming, 61 (1993), pp. 137-159.
44. C. W. KO, J. LEE, AND K. WAYNE, A Spectral Bound for D-optimality, Tech. report, Department of Mathematics, University of Kentucky, Lexington, KY, 1996.
45. J. LEE, Constrained Maximum Entropy Sampling, Tech. report, Department of Mathematics, University of Kentucky, Lexington, KY. 1995; Oper. Res., to appear.
46. A. S. LEWIS, Convex analysis on the Hermitian matrices, SIAM J. Optim., 6 (1996), pp. 164-177.
47. A. S. LEWIS AND M. L. OVERTON, Eigenvalue optimization, Acta Numerica, 5 (1996), pp. 149-190.
48. D. G. LUENBERGER, Optimization By Vector Space Methods, John Wiley, New York, 1969.
49. M. E. LUNDQUIST AND C. R. JOHNSON, Linearly constrained positive definite completions, Linear Algebra Appl., 150 (1991), pp. 195-207.
50. G. NAEVDAL AND H. J. WOERDEMAN, Partial matrix contractions and intersections of matrix balls, Linear Algebra Appl., 175 (1992), pp. 225-238.
51. Y. NESTEROV AND A. NEMIROVSKY, Interior-Point Polynomial Methods in Convex Programming, Studies Appl. Math. 13, SIAM, Philadelphia, PA, 1994.
52. J. P. NORTON, An Introduction to Identification, Academic Press, New York, 1986.
53. J. P. NORTON, Identification and application of bounded-parameter models, Automatica, 23 (1987), pp. 497-507.
54. L. PRONZATO AND E. WALTER, Minimum-volume ellipsoids containing compact sets: Application to parameter bounding, Automatica, 30 (1994), pp. 1731-1739.
55. F. PUKELSHEIM, Optimal Design of Experiments, Wiley, 1993.
56. J. RENEGAR, A polynomial-time algorithm, based on Newton's method, for linear programming, Math. Programming, 40 (1988), pp. 59-93.
57. R. T. ROCKAFELLAR, Convex Analysis, 2nd ed., Princeton University Press, Princeton, NJ, 1970.
58. J. B. ROSEN, Pattern separation by convex programming, J. Math. Anal. Appl., 10 (1965), pp. 123-134.
59. P. J. ROUSSEEUW AND A. M. LEROY, Robust Regression, and Outlier Detection, Wiley, 1987.
60. S. S. SAPATNEKAR, A Convex Programming Approach to Problems in VLSI Design, Ph.D. thesis, Coordinated Science Laboratory. University of Illinois at Urbana-Champaign, 1992.
61. L. L. SCHARF, Statistical Signal Processing, Addison-Wesley, Reading, MA, 1991.
62. F. C. SCHWEPPE, Recursive state estimation: Unknown but bounded errors and system inputs, IEEE Trans. Automat. Control, AC-13 (1968), pp. 22-28.
63. F. C. SCHWEPPE, Uncertain Dynamic Systems, Prentice Hall, Englewood Cliffs, NJ, 1973.
64. G. SONNEVEND, An 'analytical centre' for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in Lecture Notes in Control and Inform. Sci. 84, Springer-Verlag, New York, 1986, pp. 866-878.
65. G. SONNEVEND, Applications of analytic centers, in Numerical Linear Algebra, Digital Signal Processing, and Parallel Algorithms, G. Golub and P. V. Dooren, eds., NATO ASI Series F70, Springer-Verlag, New York, 1991, pp. 617-632.
66. S. TARASOV, L. KHACHIYAN, AND I. ERLIKH, The method of inscribed ellipsoids, Soviet Math. Dokl., 37 (1988), pp. 226-230.
67. D. M. TITTERINGTON, Optimal design: some geometric aspects of D-optimality, Biometrika, 62 (1975), pp. 313-320.
68. L. VANDENBERGHE AND S. BOYD, Connections between semi-infinite and semidefinite programming, in Proc. International Workshop on Semi-Infinite Programming, R. Reemtsen and J.-J. Rueckmann, eds., Kluwer Academic Publishers, Norwell, MA, 1996, to appear.
69. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
70. L. VANDENBERGHE, S. BOYD, AND S.-P. WU, Determinant Maximization with Linear Matrix Inequality Constraints, Tech. report, Information Systems Laboratory, Stanford University, Stanford, CA, 1996.
71. E. WALTER AND H. PIET-LAHANIER, Estimation of parameter bounds from bounded-error data: a survey, Math. Comput. Simulation, 32 (1990), pp. 449-468.
72. P. WHITTLE, Optimization over Time. Dynamic Programming and Stochastic Control, John Wiley, New York, 1982.
73. A. WILHELM, Computing Optimal Designs by Bundle Trust Methods, Tech. report 314, Institüt für Mathematik, Universität Augsburg, 1994.
74. A. WILHELM, Algorithms for differentiable and nondifferentiable experimental design problems, in SoftStat '95-Advances in Statistical Software, F. Faulbaum and W. Bandilla, eds., Lucius and Lucius, Stuttgart, 1995, pp. 527-534.
75. H. S. WITSENHAUSEN, Sets of possible states of linear systems given perturbed observations, IEEE Trans. Automat. Control, 13 (1968), pp. 556-558.
76. S.-P. WU, L. VANDENBERGHE, AND S. BOYD, MAXDET: Software for Determinant Maximization Problems. User's Guide, Alpha Version, Stanford University, Stanford, CA, 1996.