In this paper, we apply theUV-algorithm to solve the constrained minimization problem of a maximum eigenvalue function which is the composite function of an affine matrix-valued mapping and its maximum eigenvalue. Here, we convert the constrained problem into its equivalent unconstrained problem by the exact penalty function. However, the equivalent problem involves the sum of two nonsmooth functions, which makes it difficult to applyUV-algorithm to get the solution of the problem. Hence, our strategy first applies the smooth convex approximation of maximum eigenvalue function to get the approximate problem of the equivalent problem. Then the approximate problem, the space decomposition, and theU-Lagrangian of the object function at a given point will be addressed particularly. Finally, theUV-algorithm will be presented to get the approximate solution of the primal problem by solving the approximate problem.
Smooth Convex Approximation to the Maximum Eigenvalue Function
