Eigenvalue optimization

Acta Numerica

Volumn 5, Issue , 1996, Pages 149-190

  Lewis, Adrian S ^a   Overton, Michael L ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042602157     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492900002646     Document Type: Article

References (92)

1. Alizadeh F. (1991), Combinatorial Optimization with Interior Point Methods and Semidefinite Matrices, PhD thesis, University of Minnesota.
2. Alizadeh F. (1995), ‘Interior point methods in semidefinite programming with applications to combinatorial optimization’, SIAM J. Optim. 5, 13–51.
3. Alizadeh F., Haeberly J.-P. A. and Overton M. L. (1996 a), ‘Complementarity and nondegeneracy in semidefinite programming’, Mathematical Programming (Series B). To appear.
4. Alizadeh F., Haeberly J.-P. A. and Overton M. L. (1996 b), Primal-dual interior-point methods for semidefinite programming: convergence rates, stability, and numerical results. In preparation.
5. Arazy J. (1981), ‘On the geometry of the unit ball of unitary matrix spaces’, Integral Equations and Operator Theory 4, 151–171.
6. Ashbaugh M. S. and Benguria R. D. (1991), ‘Proof of the Payne–Pólya–Weinberger conjecture’, Bulletin of the American Math Society 25, 19–29.
7. Barbara A. and Crouzeix J.-P. (1994), ‘Concave gauge functions and applications’, ZOR – Mathematical Methods of Operations Research 40, 43–74.
8. Baumgärtel H. (1985), Analytic Perturbation Theory for Matrices and Operators, Birkhäuser, Boston.
9. Bellman R. and Fan K. (1963), On systems of linear inequalities in Hermitian matrix variables, in Convexity, American Mathematical Society, Providence, pp. 1–11. Proceedings of Symposia in Pure Mathematics VII.
10. Boyd S., Ghaoui L. E., Feron E. and Balakrishnan V. (1994), Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia.
11. Burke J. V. and Overton M. L. (1994), ‘Differential properties of the spectral abscissa and the spectral radius for analytic matrix–valued mappings’, Nonlinear Analysis, Theory, Methods and Applications 23, 467–488.
12. Clarke F. H. (1983), Optimization and Nonsmooth Analysis, Wiley, New York. Reprinted by SIAM, Philadelphia, 1990.
13. Cox S. J. (1992), ‘The shape of the ideal column’, Mathematical Intelligencer 14, 16–31.
14. Cox S. J. (1993), ‘Steven Cox responds’, Mathematical Intelligencer 15, 68.
15. Cox S. J. and Maddocks J. H. (1996), Optimal design of the nonlinear elastica. In preparation.
16. Cox S. J. and Overton M. L. (1992), ‘The optimal design of columns against buckling’, SIAM J. Math. Anal. 23, 287–325.
17. Cox S. J. and Overton M. L. (1996), ‘Perturbing the critically damped wave equation’, SIAM J. Math. Anal. To appear.
18. Craven B. D. and Mond B. (1981), ‘Linear programming with matrix variables’, Linear Algebra and its Applications 38, 73–80.
19. Cullum J., Donath W. E. and Wolfe P. (1975), ‘The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices’, Mathematical Programming Study 3, 35–55.
20. Dantzig G. B. (1991), Linear programming, in History of Mathematical Programming: A Collection of Personal Reminiscences (Lenstra J. K., Rinnooy Kan A. H. G. and Schrijver A., eds), North-Holland, Amsterdam, pp. 19–31.
21. Davis C. (1957), ‘All convex invariant functions of Hermitian matrices’, Archiv der Mathematik 8, 276–278.
22. de Sá E. M. (1994 a), ‘Exposed faces and duality for symmetric and unitarily invariant norms’, Linear Algebra and its Applications 197,198, 429–450.
23. de Sá E. M. (1994 b), ‘Faces and traces of the unit ball of a symmetric gauge function’, Linear Algebra and its Applications 197,198, 349–395.
24. de Sá E. M. (1994 c), ‘Faces of the unit ball of a unitarily invariant norm’, Linear Algebra and its Applications 197,198, 451–493.
25. Deville R., Godefroy G. and Zizler V. (1993), Smoothness and Renormings in Banach Spaces, Longman, Harlow, UK.
26. Donath W. E. and Hoffman A. J. (1973), ‘Lower bounds for the partitionings of graphs’, IBM Journal of Research and Development 17, 420–425.
27. Fiedler M. (1973), ‘Algebraic connectivity of graphs’, Czech. Math. Journal 23, 298–305.
28. Fletcher R. (1985), ‘Semi-definite constraints in optimization’, SIAM J. Control Optim. 23, 493–513.
29. Fletcher R. (1991), ‘A new variational result for quasi-Newton formulae’, SIAM J. Optim. 1, 18–21.
30. Friedland S. (1981), ‘Convex spectral functions’, Linear and multilinear algebra 9, 299–316.
31. Friedland S., Nocedal J. and Overton M. L. (1987), ‘The formulation and analysis of numerical methods for inverse eigenvalue problems’, SIAM J. Numer. Anal. 24, 634–667.
32. Goemans M. X. and Williamson D. P. (1996), ‘Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming’, J. Assoc. Comput. Mach. To appear.
33. Gonzaga C. C. (1992), ‘Path-following methods for linear programming’, SIAM Review 34, 167–224.
34. Grötschel M., Lovász L. and Schriver A. (1988), Geometric Algorithms and Combinatorial Optimization, Springer, New York.
35. Helmberg C. (1994), An Interior Point Method for Semidefinite Programming and Max-Cut Bounds, PhD thesis, Technische Universitát Graz, Austria.
36. Helmberg C., Rendl F., Vanderbei R. and Wolkowicz H. (1996), ‘An interior-point method for semidefinite programming’, SIAM J. Optim. To appear.
37. Hirriart-Urruty J.-B. and Ye D. (1995), ‘Sensitivity analysis of all eigenvalues of a symmetric matrix’, Numer. Math. 70, 45–72.
38. Horn R. A. and Johnson C. R. (1985), Matrix Analysis, Cambridge University Press, UK.
39. Horn R. A. and Johnson C. R. (1991), Topics in Matrix Analysis, Cambridge University Press, UK.
40. Karmarkar N. (1984), ‘A new polynomial time algorithm for linear programming’, Combinatorica 4, 373–395.
41. Karmarkar N. and Thakur S. (1992), An interior-point approach to a tensor optimization problem with application to upper bounds in integer quadratic optimization problems, in Integer Programming and Combinatorial Optimization (Balas E., Cornuejils G. and Kannan R., eds), pp. 406–419. Proceedings of a conference held at Carnegie Mellon University by the Math. Programming Society.
42. Kirmser P. G. and Hu K.-K. (1993), ‘The shape of the ideal column reconsidered’, Mathematical Intelligencer 15, 62–67.
43. Kojima M., Mizuno S. and Yoshise A. (1989), A primal-dual interior point method for linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods (Megiddo N., ed.), Springer, New York, pp. 29–47.
44. Kojima M., Shindoh S. and Hara S. (1994), Interior-point methods for the monotone linear complementarity problem in symmetric matrices. Technical Report B-282, Department of Information Sciences, Tokyo Inst. of Technology.
45. Lewis A. S. (1995 a), ‘The convex analysis of unitarily invariant functions’, J. Convex Anal. 2, 173–183.
46. Lewis A. S. (1995 b), Eigenvalue-constrained faces. Technical Report CORR 95–22, University of Waterloo. Submitted to Linear Algebra and its Applications.
47. Lewis A. S. (1995 c), Von Neumann‘s lemma and a Chevalley-type theorem for convex functions on Cartan subspaces. Technical Report CORR 95–19, University of Waterloo. Submitted to Transactions of the American Mathematical Society.
48. Lewis A. S. (1996 a), ’Convex analysis on the Hermitian matrices‘, SIAM J. Optim. 6, 164–177.
49. Lewis A. S. (1996 b), ’Derivatives of spectral functions‘, Mathematics of Operations Research. To appear.
50. Lewis A. S. (1996 c), ‘Group invariance and convex matrix analysis’, SIAM J. Matrix Anal. Appl. To appear.
51. Lustig I. J., Marsten R. E. and Shanno D. F. (1994), ‘Interior point methods for linear programming: Computational state of the art’, ORSA Journal on Computing 6, 1–14.
52. Marshall A. W. and Olkin I. (1979), Inequalities: Theory of Majorization and its Applications, Academic Press, New York.
53. Martínez-Legaz J.-E. (1995), On convex and quasi-convex spectral functions. Technical report, Universitat Autònoma de Barcelona.
54. McLinden L. (1980), ‘An analogue of Moreau's proximation theorem with applications to nonlinear complementarity problems’, Pacific Journal of Mathematics pp. 101–161.
55. Megiddo N. (1989), Pathways to the optimal set in linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods (Megiddo N., ed.), Springer, New York, pp. 131–158.
56. Mohar B. and Poljak S. (1993), Eigenvalues in combinatorial optimization, in Combinatorial and graph-theoretic problems in linear algebra (Brualdi R., Friedland S. and Klee V., eds), Vol. 50, Springer. IMA Volumes in Mathematics and its Applications.
57. Monteiro R. and Adler I. (1989), ‘Interior path-following primal-dual algorithms: Part I: Linear programming’, Mathematical Programming 44, 27–41.
58. Moro J., Burke J. V. and Overton M. L. (1995), On the Lidskii–Vishik–Lyusternik perturbation theory for eigenvalues of matrices with arbitrary Jordan structure. Technical Report 710, NYU Comp. Sci. Dept. Submitted to SIAM J. Matr. Anal. Appl.
59. Nesterov Y. and Nemirovskii A. (1994), Interior Point Polynomial Methods in Convex Programming, SIAM, Philadelphia.
60. Nesterov Y. and Todd M. (1996), ‘Self-scaled barriers and interior-point methods for convex programming’, Mathematics of Operations Research. To appear.
61. Olhoff N. and Rasmussen S. (1977), ‘On single and bimodal optimum buckling loads of clamped columns’, Int. J. Solids Struct. 9, 605–614.
62. Ortega J. M. (1972), Numerical Analysis: A Second Course, Academic Press, New York and London. Reprinted by SIAM, Philadelphia, 1990.
63. Overton M. L. (1988), ‘On minimizing the maximum eigenvalue of a symmetric matrix’, SIAM J. Matrix Anal. Appl. 9, 256–268.
64. Overton M. L. (1992), ‘Large-scale optimization of eigenvalues’, SIAM J. Optim. 2, 88–120.
65. Overton M. L. and Womersley R. S. (1988), ‘On minimizing the spectral radius of a nonsymmetric matrix function – optimality conditions and duality theory’, SIAM J. Matrix Anal. Appl. 9, 473–498.
66. Overton M. L. and Womersley R. S. (1993), ‘Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices’, Mathematical Programming 62, 321–357.
67. Overton M. L. and Womersley R. S. (1995), ‘Second derivatives for optimizing eigenvalues of symmetric matrices’, SIAM J. Matrix Anal. Appl. 16, 697–718.
68. Pataki G. (1995), On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Technical Report MSRR-604 (revised), Graduate School of Industrial Administration, Carnegie–Mellon University. Submitted to Math. of Operations Research.
69. Payne L. E., Pólya G. and Weinberger H. F. (1956), ‘On the ratio of consecutive eigenvalues’, Journal of Mathematics and Physics 35, 289–298.
70. Poljak S. and Tuza Z. (1993), Max-cut problem – a survey. Technical report, Charles University, Prague.
71. Pothen A. (1996), Graph partitioning algorithms in scientific computing, in Parallel Numerical Algorithms (Keyes D., Sameh A. and Venkatakrishnan V., eds), Kluwer. To appear.
72. Rendl F. and Wolkowicz H. (1992), ‘Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem’, Mathematical Programming 53, 63–78.
73. Ringertz U. T. (1995), ‘An algorithm for optimization of nonlinear shell structures’, International Journal for Numerical Methods in Engineering 38, 299–314.
74. Ringertz U. T. (1996), Eigenvalues in optimum structural design, in Proceedings of an IMA workshop on Large-Scale Optimization (Conn A. R., Biegler L. T., Coleman T. F. and Santosa F., eds). To appear.
75. Rockafellar R. T. (1970), Convex Analysis, Princeton University Press, Princeton University.
76. Schramm H. and Zowe J. (1992), ‘A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results’, SIAM J. Optim. 2, 121–152.
77. Seeger A. (1996), ‘Convex analysis of spectrally-defined matrix functions’, SIAM J. Optim. To appear.
78. Shapiro A. (1996), ‘First and second order analysis of nonlinear semidefinite programs’, Mathematical Programming (Series B). To appear.
79. Shapiro A. and Fan M. K. H. (1995), ‘On eigenvalue optimization’, SIAM J. Optim. 3, 552–568.
80. Tadjbakhsh I. and Keller J. B. (1962), ‘Strongest columns and isoperimetric inequalities for eigenvalues’, J. Appl. Mech. 29, 159–164.
81. Theobald C. M. (1975), ‘An inequality for the trace of the product of two symmetric matrices’, Mathematical Proceedings of the Cambridge Philosophical Society 77, 265–266.
82. Tsing N.-K., Fan M. K. H. and Verriest E. I. (1994), ‘On analyticity of functions involving eigenvalues’, Linear Algebra and its Applications 207, 159–180.
83. Tunçel L. (1995). Private communication.
84. Vandenberghe L. and Boyd S. (1995), ‘Primal-dual potential reduction method for problems involving matrix inequalities’, Mathematical Programming (Series B) 69, 205–236.
85. Vandenberghe L. and Boyd S. (1996), ‘Semidefinite programming’, SIAM Review 38, 49–95.
86. Watson G. A. (1992), ‘Characterization of the subdifferential of some matrix norms’, Linear Algebra and its Applications 170, 33–45.
87. Wright M. H. (1992), Interior methods for constrained optimization, in Acta Numerica, Cambridge University Press, UK, pp. 341–407.
88. Wright S. J. (1995), ‘Stability of linear equations solvers in interior-point methods’, SIAM J. Matrix Anal. Appl. 16, 1287–1307.
89. Zhang Y. and Tapia R. A. (1993), ‘A superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming’, SIAM J. Optim. 3, 118–133.
90. Zhang Y., Tapia R. A. and Dennis J. E. (1992), ‘On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms’, SIAM J. Optim. 2, 304–324.
91. Ziȩtak K. (1988), ‘On the characterization of the extremal points of the unit sphere of matrices’, Linear Algebra and its Applications 106, 57–75.
92. Ziȩtak K. (1993), ‘Subdifferentials, faces and dual matrices’, Linear Algebra and its Applications 185, 125–141.