it is more efficient to apply the analytic center cutting plane method than to convert it a semidefinite programming problem.A multiple-cut algorithm for the problem was proposed by improving the single-cut algorithm.Its convergence was discussed.The conclusion is proved that it is a quadratic convergent method.
关键词
Keywords
references
Sun Jie,Kim-Chuan,Zhao Gongyun.An analytic center cutting plane method for semidefinite feasibility problems[J].Mathematic of Operation Research,2002,27(2):332-346.
Boyd S,Ghuoui L E,Feron E,et al.Linear matrix inequalities in system and control theory[M].Philadelphia:SIAM Academic Publishers,1994.
Nesterov Y.Cutting plane algorithms from analytic centers:efficiency estimates[J].Math Programming,1995,69:149-176.
Ye Yinyu.Complexity analysis of the analytic center cutting plane method that uses multiple cuts[J].MathProgramming,1997,78:85-104.