摘要
A new kind of algorithm for semidefinite programming is presented by using theGolden Section Method, which sufficiently utilizes structure of the set of feasiblesolutions. Because of the simplicity and less operations, the algorithm can be usedto solve large scale problems. As a successful application, a numerical example ofMax-cut problem is given.
A new kind of algorithm for semidefinite programming is presented by using the Golden Section Method, which sufficiently utilizes structure of the set of feasible solutions. Because of the simplicity and less operations, the algorithm can be used to solve large scale problems. As a successful application, a numerical example of Max-cut problem is given.
出处
《数值计算与计算机应用》
CSCD
北大核心
2003年第2期81-87,共7页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金(69972036)
陕西省自然科学基金(2001SL05)资助项目
