A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions (Q2336689)

Summary: For constrained minimization problem of maximum eigenvalue functions, since the objective function is nonsmooth, we can use the approximate inexact accelerated proximal gradient (AIAPG) method [\textit{W. Wang}, \textit {J. J. Gao} and \textit{S. H. Li}, ``Approximate inexact accelerated proximal gradient method for the minimization problem of a class of maximum eigenvalue functions'', J. Liaoning Normal University 36, No. 3, 314--317 (2013), \url{http://en.cnki.com.cn/Article_en/CJFDTotal-LNSZ201303003.htm}] to solve its smooth approximation minimization problem. When we take the function \(g(X)=\delta_\Omega (X) (\Omega :=\{ X\in S^n : \mathcal{F} (X) =b,X\succeq 0\})\) in the problem \(\min \{\lambda_{\max} (X) + g(X) : X \in S^n \}\), where \(\lambda_{\max}(X)\) is the maximum eigenvalue function, \(g(X)\) is a proper lower semicontinuous convex function (possibly nonsmooth) and \(\delta_{\Omega}(X)\) denotes the indicator function. But the approximate minimizer generated by AIAPG method must be contained in \(\Omega\) otherwise the method will be invalid. In this paper, we will consider the case where the approximate minimizer cannot be guaranteed in \(\Omega\). Thus we will propose two different strategies, respectively, constructing the feasible solution and designing a new method named relax inexact accelerated proximal gradient (RIAPG) method. It is worth mentioning that one advantage when compared to the former is that the latter strategy can overcome the drawback. The drawback is that the required conditions are too strict. Furthermore, the RIAPG method inherits the global iteration complexity and attractive computational advantage of AIAPG method.