Abstract
It has been recently reported that minimax eigenvalue problems can be formulated as nonlinear optimization problems involving smooth objective and constraint functions. This result seems very appealing since minimax eigenvalue problems are known to be typically nondifferentiable. In this paper, we show, however, that general purpose nonlinear optimization algorithms usually fail to find a solution to these smooth problems even in the simple case of minimization of the maximum eigenvalue of an affine family of symmetric matrices, a convex problem for which efficient algorithms are available.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Laub, A. J.,An Inequality and Some Computations Related to the Robust Stability of Dynamic Systems, IEEE Transactions on Automatic Control, Vol. AC-24, pp. 318–320, 1979.
Doyle, J. C.,Robustness of Multiloop Linear Feedback Systems, Proceedings of the 17th IEEE Conference on Decision and Control, San Diego, California, pp. 12–18, 1979.
Freudenberg, J. S., Looze, D. P., andCruz, J. B.,Robustness Analysis Using Singular-Value Sensitivities, International Journal of Control, Vol. 35, pp. 95–116, 1982.
Kato, T.,Perturbation Theory for Linear Operators, 2nd Edition, Springer-Verlag, Berlin, Germany, 1976.
Cullum, J., Donath, W. E., andWolfe, P.,The Minimization of Certain Nondifferentiable Sums of Eigenvalues of Symmetric Matrices, Nondifferentiable Optimization, Edited by M. Balinski and P. Wolfe, Mathematical Programming Study 3, North-Holland, Amsterdam, Holland, pp. 35–55, 1975.
Polak, E., andWardi, Y.,Nondifferentiable Optimization Algorithm for the Design of Control Systems Subject to Singular-Value Inequalities, Automatica, Vol. 18, pp. 267–283, 1982.
Fletcher, R.,Semi-Definite Matrix Constraints in Optimization, SIAM Journal on Control and Optimization, Vol. 23, pp. 493–513, 1985.
Overton, M. L.,On Minimizing the Maximum Eigenvalue of a Symmetric Matrix, SIAM Journal on Matrix Analysis and Applications, Vol. 9, pp. 256–268, 1988.
Overton, M. L., andWomersley, R. S.,On Minimizing the Spectral Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory, SIAM Journal on Matrix Analysis and Applications (to appear).
Goh, C. J., andTeo, K. L.,On Minimax Eigenvalue Problems via Constrained Optimization, Journal of Optimization Theory and Applications, Vol. 57, pp. 59–68, 1988.
Bartholomew-Biggs, M. C.,A Globally Convergent Version of REQP for Constrained Minimization, IMA Journal of Numerical Analysis, Vol. 8, pp. 253–271, 1988.
Powell, M. J. D.,A Fast Algorithm for Nonlinearly Constrained Optimization Calculations, Numerical Analysis, Dundee 1977, Edited by G. A. Watson, Springer-Verlag, Berlin, Germany, pp. 144–157, 1977.
Hopper, M. J.,Harwell Library, Catalogue of Subroutines, Library Reference Manual, Harwell, England, 1978.
Author information
Authors and Affiliations
Additional information
Communicated by C. T. Leondes
This work was supported in part by NSF Engineering Research Centers Program No. NSFD-CDR-88-03012 and NSF Grant DMC-84-20740. The author wishes to thank Drs. M. K. H. Fan and A. L. Tits for their many useful suggestions.
Rights and permissions
About this article
Cite this article
Panier, E.R. On the need for special purpose algorithms for minimax eigenvalue problems. J Optim Theory Appl 62, 279–287 (1989). https://doi.org/10.1007/BF00941058
Issue Date:
DOI: https://doi.org/10.1007/BF00941058