Convex analysis on the Hermitian matrices

SIAM Journal on Optimization

Volumn 6, Issue 1, 1996, Pages 164-177

  Lewis, A S ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Convexity; Fenchel duality; Matrix function; Quasi Newton update; Schur convexity; Semidefinite programming; Spectral function; Subdifferential; Unitarily invariant

Indexed keywords

EID: 0030304775     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806009     Document Type: Article

References (38)

1. F. ALIZADEH, Optimization over the positive definite cone: interior point methods and combinatorial applications, in Advances in Optimization and Parallel Computing, P. Pardolos, ed., North-Holland, Amsterdam, 1992, pp. 1-25.
2. _, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
3. J. ARAZY, On the geometry of the unit ball of unitary matrix spaces, Integral Equations Operator Theory, 4 (1981), pp. 151-171.
4. C. DAVIS, All convex invariant functions of hermitian matrices, Archiv der Mathematik, 8 (1957), pp. 276-278.
5. E.M. DE SÁ, Exposed faces and duality for symmetric and unitarily invariant norms, Linear Algebra Appl., 197,198 (1994), pp. 429-450.
6. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
7. P. A. FILLMORE AND J. P. WILLIAMS, Some convexity theorems for matrices, Glasgow Math. J., 12 (1971), pp. 110-117.
8. R. FLETCHER, Semi-definite matrix constraints in optimization, SIAM J. Control Optim., 23 (1985), pp. 493-513.
9. _, A new variational result for quasi-Newton formulae, SIAM J. Optim., 1 (1991), pp. 18-21.
10. S. FRIEDLAND, Convex spectral functions, Linear Multilinear Algebra, 9 (1981), pp. 299-316.
11. G. H. HARDY, J. E. LITTLEWOOD, AND G. PÓLYA, Inequalities, Cambridge University Press, Cambridge, UK, 1952.
12. J.-B. HIRIART-URRUTY, A. SEEGER, AND D. YE, Sensitivity analysis for a class of convex functions defined over a space of symmetric matrices, Vol. 382, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, New York, 1992, pp. 133-154.
13. J.-B. HIRIART-URRUTY AND D. YE, Sensitivity Analysis of all Eigenvalues of a Symmetric Matrix, Tech. report, Laboratoire d'analyse numerique, Université Paul Sabatier, Toulouse, France, 1992.
14. R. A. HORN AND C. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
15. F. JARRE, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Control Optim., 31 (1993), pp. 1360-1377.
16. F. JOHN, On symmetric matrices whose eigenvalues satisfy linear inequalities, Proc. American Mathematical Society, 17 (1966), pp. 1140-1146.
17. A. S. LEWIS, Derivatives of Spectral Functions, Tech. Report CORR 94-04, University of Waterloo, 1994; Math. Oper. Res., to appear.
18. M. MARCUS, Convex functions of quadratic forms, Duke Math. J., 24 (1957), pp. 321-326.
19. A. W. MARSHALL AND I. OLKIN, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
20. L. MIRSKY, On the trace of matrix products, Math. Nach., 20 (1959), pp. 171-174.
21. Y. E. NESTEROV AND A. S. NEMIROVSKY, Interior Point Polynomial Methods in Convex Programming, Society for Industrial and Applied Mathematics, Philadelphia, 1994.
22. M.L. OVERTON, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 256-268.
23. _, Large-scale optimization of eigenvalues, SIAM J. Optim., 2 (1992), pp. 88-120.
24. M.L. OVERTON AND R.S. WOMERSLEY, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices, Math. Programming, Series B, 62 (1993), pp. 321-357.
25. F. RENDL AND H. WOLKOWICZ, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Math. Programming, 53 (1992), pp. 63-78.
26. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
27. A. SHAPIRO, Extremal problems on the set of nonnegative definite matrices, Linear Algebra Appl., 67 (1985), pp. 7-18.
28. A. SHAPIRO AND M.K.H. FAN, On eigenvalue optimization, SIAM J. Optim., 5 (1995), pp. 552-569.
29. C.M. THEOBALD, An inequality for the trace of the product of two symmetric matrices, Math. Proc. Cambridge Philosophical Soc., 77 (1975), p. 265.
30. J. VON NEUMANN, Some matrix inequalities and metrization of matric-space, Tomsk University Rev., 1 (1937), pp. 286-300. In Collected Works, Vol. IV, Pergamon Press, Oxford, 1962, pp. 205-218.
31. J. VON NEUMANN, Some matrix inequalities and metrization of matric-space, Tomsk University Rev., 1 (1937), pp. 286-300. In Collected Works, Vol. IV, Pergamon Press, Oxford, 1962, pp. 205-218.
32. G. A. WATSON, Characterization of the subdifferential of some matrix norms, Linear Algebra Appl., 170 (1992), pp. 33-45.
33. _, On matrix approximation problems with Ky Fan k norms, Numer. Algorithms, 5 (1993), pp. 263-272.
34. H. WOLKOWICZ, Explicit Solutions for Interval Semidefinite Linear Programs, Tech. Report CORR 93-29, Department of Combinatorics and Optimization, University of Waterloo, 1993.
35. H. WOLKOWICZ AND Q. ZHAO, An Efficient Region of Optimal Updates for Least Change Secant Methods, Tech. Report CORR 92-27, Department of Combinatorics and Optimization, University of Waterloo, 1992.
36. B. YANG AND R.J. VANDERBEI, The Simplest Semidefinite Programs are Trivial, Tech. report, Program in Statistics and Operations Research, Princeton University, Princeton, NJ, 1993.
37. K. ZIȨTAK, On the characterization of the extremal points of the unit sphere of matrices, Linear Algebra Appl., 106 (1988), pp. 57-75.
38. _, Subdifferentials, faces and dual matrices, Linear Algebra Appl., 185 (1993), pp. 125-141.