Abstract
A semidefinite programming problem is a mathematical program in which the objective function is linear in the unknowns and the constraint set is defined by a linear matrix inequality. This problem is nonlinear, nondifferentiable, but convex. It covers several standard problems (such as linear and quadratic programming) and has many applications in engineering. Typically, the optimal eigenvalue multiplicity associated with a linear matrix inequality is larger than one. Algorithms based on prior knowledge of the optimal eigenvalue multiplicity for solving the underlying problem have been shown to be efficient. In this paper, we propose a scheme to estimate the optimal eigenvalue multiplicity from points close to the solution. With some mild assumptions, it is shown that there exists an open neighborhood around the minimizer so that our scheme applied to any point in the neighborhood will always give the correct optimal eigenvalue multiplicity. We then show how to incorporate this result into a generalization of an existing local method for solving the semidefinite programming problem. Finally, a numerical example is included to illustrate the results.
Similar content being viewed by others
References
BOYD, S., EL GHAOUI, L., FERON, E., and BALAKRISHNAN, V., Linear Matrix Inequalities in System and Control Theory, SIAM Studies in Applied Mathematics, SIAM, Philadelphia, Pennsylvania, 1994.
KATO, T., Perturbation Theory for Linear Operators, 2nd Edition, Springer, Berlin, Germany, 1976.
OVERTON, M. L., On Minimizing the Maximum Eigenvalue of a Symmetric Matrix, SIAM Journal on Matrix Analysis and Applications, Vol. 9, pp. 256–286, 1988.
FAN, M. K. H., A Quadratically Convergent Local Algorithm on Minimizing the Largest Eigenvalue of a Symmetric Matrix, Linear Algebra and Its Applications, Vols. 188–189, pp. 231–253, 1993.
NEKOOIE, B., and FAN, M. K. H., A Quadratically Convergent Local Algorithm on Minimizing the Sums of Largest Eigenvalues of a Symmetric Matrix, Computational Optimization and Applications, Vol. 2, pp. 107–127, 1993.
NEKOOIE, B., Convex Optimization Involving Linear Matrix Inequalities, PhD Thesis, Georgia Institute of Technology, 1994.
TSING, N. K., FAN, M. K. H., and VERRIEST, E. I., On Analyticity of Functions Involving Eigenvalues, Linear Algebra and Its Applications, Vol. 207, pp. 159–180, 1994.
SHAPIRO, A., and FAN, M. K. H., On Eigenvalue Optimization, SIAM Journal on Optimization, Vol. 5, pp. 552–569, 1995.
FAN, M. K. H., and NEKOOIE, B., An Algorithm on Minimizing Generalized Eigenvalues with Linear Matrix Inequality Constraints, Proceedings of the 1994 American Control Conference, Baltimore, Maryland, Vol. 1, pp. 831–835, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fan, M.K.H., Gong, Y. Eigenvalue Multiplicity Estimate in Semidefinite Programming. Journal of Optimization Theory and Applications 94, 55–72 (1997). https://doi.org/10.1023/A:1022603518289
Issue Date:
DOI: https://doi.org/10.1023/A:1022603518289