Necessary and sufficient conditions for global optimality of eigenvalue optimization problems

The necessary and sufficient conditions for global optimality are derived for an eigenvalue optimization problem. We consider the generalized eigenvalue problem where real symmetric matrices on both sides are linear functions of design variables. In this case, a minimization problem with eigenvalue constraints can be formulated as Semi‐Definite Programming (SDP). From the Karush‐Kuhn‐Tucker conditions of SDP, the necessary and sufficient conditions are derived for arbitrary multiplicity of the lowest eigenvalues for the case where important lower bound constraints are considered for the design variables.