解凸二次半定规划的交替方向法Alternating Direction Methods for Solving Convex Quadratic Semidefinite Programming
李成进;
摘要(Abstract)：
给出求解凸二次半定规划的交替方向法,并对这个算法的全局收敛性进行分析.
关键词(KeyWords)： 凸二次半定规划;交替方向法;全局收敛性
基金项目(Foundation): 福建省自然科学基金资助项目(2009J05003)
作者(Authors): 李成进;
参考文献(References)：
- [1]Sun D F.The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite pro-gramming and their implications[J].Mathematics of Operations Research,2006(31):761-776.
- [2]Li C J,Sun W Y.On filter-successive linearization methods for nonlinear semidefinite programming[J].Science inChina,2009(52):2341-2361.
- [3]李成进,孙文瑜.非凸半定规划的广义Fakars引理及最优性条件[J].高校计算数学学报,2008(30):184-192.
- [4]Li C J,Sun W Y.A class of nonsmooth Newton-type methods for nonlinear semidefinite programming[J].JNanjing Norm Univ Nat Sci Ed,2008(31):1-7.
- [5]Toh K C,Tutuncu R H,Todd M J.Inexact primal-dual path-following algorithms for a special class of convexquadratic SDP and related problems[J].Pacific J Optimization,2007(3):135-164.
- [6]Higham N J.Computing the nearest correlation matrix-a problem from finance[J].IMA J Numer Analysis,2002(22):329-343.
- [7]Yu Z.Solving semidefinite programming problems via alternating direction methods[J].J Comp Appl Math,2006(193):437-445.