An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming

References

• Adler , I and Alizadeh , F . 1995 . “ Primal-dual interior-point algorithms for convex quadratically constrained and semidefinite optimization problems ” . In Technical Report RRR-111-95 , Rutgers University : RUTCOR .
   Google Scholar
• Ai , WB . 2004 . A neighborhood following algorithm for linear programming . Sci. China Ser. A , 47 : 812 – 820 .
   Google Scholar
• Alizadeh and Goldfarb , DF . 2003 . Second-order cone programming . Math. Program. Ser. B , 95 : 3 – 51 .
   Web of Science ®Google Scholar
• Faraut , J and Koryi , A . 1994 . Analysis on Symmetric Cones , New York : Oxford University Press .
   Google Scholar
• Faybusovich , L . 1995 . “ Jordan algebras, symmetric cones and interior-point methods ” . In Manuscript, Department of Mathematics , IN , , USA : Notre Dame .
   Google Scholar
• Faybusovich , L . 1997 . Linear systems in Jordan algebras and primal-dual interior-point algorithms . J. Comput. Appl. Math. , 86 : 149 – 175 .
   Web of Science ®Google Scholar
• Faybusovich , L . 1997 . Euclidean Jordan algebras and interior-point algorithms . Positivity , 1 : 331 – 357 .
   Web of Science ®Google Scholar
• Feng , ZZ and Fang , L . 2010 . A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming . Optimization , 59 : 1235 – 1246 .
   Web of Science ®Google Scholar
• Jarre , F , Kocvara , M and Zowe , J . 1995 . Optimal truss topology design by interior point methods . Cooperative Res. Rep. Instit. Statis. Math. , 77 : 236 – 252 .
   Google Scholar
• Lobo , M , Vandenberghe , L , Boyd , S and Lebret , H . 1998 . Applications of second-order cone programming . Linear Algebra Appl. , 284 : 193 – 228 .
   Web of Science ®Google Scholar
• Monteiro , RDC and Tsuchiya , T . 2000 . Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions . Math. Program. Ser. A , 88 : 61 – 83 .
   Web of Science ®Google Scholar
• Monteiro , RDC and Zhang , Y . 1998 . A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming . Math. Program. , 81 : 281 – 299 .
   Web of Science ®Google Scholar
• Nesterov , Yu and Nemirovskii , A . 1988 . Polynomial barrier methods in convex programming . Ekonomika i Matem. Metody , 24 : 1084 – 1091 .
   Google Scholar
• Nesterov , YE and Nemirovskii , A . 1994 . Interior Point Polynomial Methods in Convex Programming , Philadelphia : SIAM .
   Google Scholar
• Nesterov , YE and Todd , M . 1997 . Self-scaled barriers and interior-point methods for convex programming . Math. Oper. Res. , 22 : 1 – 42 .
   Web of Science ®Google Scholar
• Nesterov , YE and Todd , M . 1998 . Primal-dual interior-point methods for self-scaled cones . SIAM J. Optim. , 8 : 324 – 364 .
   Web of Science ®Google Scholar
• Schmieta , SH and Alizadeh , F . 2003 . Extension of primal-dual interior point algorithms to symmetric cones . Math. Program., Ser. A , 96 : 409 – 438 .
   Web of Science ®Google Scholar
• T. Tsuchiya, A polynomial primal-dual path-following algorithm for second-order cone programming, Research Memorandum No. 649, The Institute of Statistical Mathematics, Tokyo, Japan, October (Revised: December 1997), 1997.
   Google Scholar
• Tsuchiya , T . 1999 . A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming . Optim. Methods Software , 11 : 141 – 182 .
   Web of Science ®Google Scholar
• Xue , G and Ye , Y . 1997 . Efficient algorithms for minimizing a sum of Euclidean norms with applications . SIAM J. Optim. , 7 : 1017 – 1036 .
   Web of Science ®Google Scholar
• Zhang , Y . 1998 . On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming . SIAM J. Optim. , 8 : 365 – 386 .
   Web of Science ®Google Scholar