$${\cal U}{\cal V}$$ U V -theory of a Class of Semidefinite Programming and Its Applications
Acta Mathematicae Applicatae Sinica, English Series(2021)
摘要
In this paper we study optimization problems involving convex nonlinear semidefinite programming (CSDP). Here we convert CSDP into eigenvalue problem by exact penalty function, and apply the
$${\cal U}$$
-Lagrangian theory to the function of the largest eigenvalues, with matrix-convex valued mappings. We give the first-and second-order derivatives of
$${\cal U}$$
-Lagrangian in the space of decision variables Rm when transversality condition holds. Moreover, an algorithm frame with superlinear convergence is presented. Finally, we give one application: bilinear matrix inequality (BMI) optimization; meanwhile, list their
$${\cal U}{\cal V}$$
decomposition results.
更多查看译文
关键词
semidefinite programming,nonsmooth optimization,eigenvalue optimization,-decomposition,-Lagrangian,smooth manifold,second-order derivative,90C30,52A41,49J52,15A18
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要