There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear programming over symmetric cones （SCLP）. The objective here is to extend the Qi-Sun-Zho...There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear programming over symmetric cones （SCLP）. The objective here is to extend the Qi-Sun-Zhou＇s smoothing Newton algorithm to solve SCLP, where characterization of symmetric cones using Jordan algebras forms the fundamental basis for our analysis. By using the theory of Euclidean Jordan algebras, the authors show that the algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results for solving the second-order cone programming are also reported.展开更多
基金This research is supported by the National Natural Science Foundation of China under Grant No. 10871144 and the Natural Science Foundation of Tianjin under Grant No. 07JCYBJC05200.
文摘There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear programming over symmetric cones （SCLP）. The objective here is to extend the Qi-Sun-Zhou＇s smoothing Newton algorithm to solve SCLP, where characterization of symmetric cones using Jordan algebras forms the fundamental basis for our analysis. By using the theory of Euclidean Jordan algebras, the authors show that the algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results for solving the second-order cone programming are also reported.
