Eigenvalue optimization and subdifferentials
Optimization problems involving a symmetric matrix variable X are becoming increasingly prominent, and appear in many applications. Very often the objective or constraint functions are spectral functions, that is symmetric functions of the eigenvalues of X. Common examples are the maximum eigenvalue of X, log det X, and the indicator function of the cone of positive semidefinite matrices. The study of first-order conditions, duality, and sensitivity results necessitates the calculation of derivatives, subdifferentials (convex or Clarke) or Fenchel conjugates of spectral functions on the space of symmetric matrices (endowed with the trace inner product). Three cases will be considered in turn: convex, differentiable, and locally Lipschitz. Surprisingly, in each case simple and unified calculations are possible for completely general spectral functions. The resulting formulae are elegant, powerful and illuminating.
- OSTI ID:
- 36216
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0540
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Subdifferentials with respect to dualities
Linesearchers in interior point methods and perturbed eigenvalues