Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function

Acta Mathematica Sinica, English Series

Volumn 23, Issue 11, 2007, Pages 2027-2042

  Bai, Yan Qin ^a   Wang, Guo Qiang ^b  

^a SHANGHAI UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY OF ENGINEERING SCIENCE   (China)

Author keywords

Interior point methods; Large and small update methods; Linear optimization; Polynomial time complexity; Second order cone optimization

Indexed keywords

EID: 35648956181     PISSN: 14398516     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10114-007-0967-z     Document Type: Article

References (16)

1. Adler, I., Alizadeh, F.: Primal-dual interior point algorithms for convex quadratically constrained and semidefinite optimization promblems, Technical report RRR-111-95, Rutgers Center for Operations Research, New Brunswick, NJ, 1995
2. Peng, J., Roos, C., Terlaky, t.: Self-Regularity. A New Paradigm for Primal-Dual Interior-Point Algorithms, Princeton University Press, Princeton, NJ, 2002
3. Wang, G. Q., Bai, Y. Q., Roos, C.: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function. Journal of Mathematical Modelling and Algorithms, 4, 409-433 (2005)
4. Huang, X. X., Teo, K. L, Yang, X. Q.: Approximate augmented Lagrangian functions and nonlinear semidefinite programs. Acta Mathematica Sinica, English Series, 22(5), 1283-1296 (2006)
5. Lobo, M. S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of the second-order cone programming. Linear Algebra and Applications, 284, 193-228 (1998)
6. Andersen, E. D., Roos, C., Terlaky, T.: On implementing a primal-dual interior point methods for conic quadratic optimization. Mathematical Programming Ser. B, 95, 249-277 (2003)
7. Faybusovich, L.: Linear system in Jordan algebras and primal-dual interior-point algorithms. Journal of Computational and Applitied Mathematics, 86(1), 149-175 (1997)
8. Monteiro, R. D. C., Tsuchiya, T.: Polynomial convergence of primal-dual algorithms for the second-order program based the MZ-family of directions. Mathematical Progamming, 88, 61-93 (2000)
9. Nesterov, Yu., Todd, M. J.: Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization, 8(2), 324-364 (1998)
10. Schmieta, S. H., Alizadeh, F.: Associtive and Jordan algebras, and Polynimal Time Interior-Point Algorithms for aymmetric cones. Mathematics of Operation Research, 26(3), 543-564 (2001)
11. Tsuchiya, T.: A convergence analysis of the scaling-invariant primal-dual path-Following algorithms for second-order cone programing. Optimization Mehtods & Software, 11(12), 141-182 (1999)
12. Bai, Y. Q., Ghami, M. El, Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM Journal on Optimization, 15(1), 101-128 (2004)
13. Roos, C., Terlaky, T., Ph. Vial, J.: Theory and Algorithms for Linear Optimization, An Interior-Point Approach, John Wiley & Sons, Chichester, UK, 1997
14. Bai, Y. Q., Roos, C.: A polynimial-time algorithm for inear optimization based a new simple kernel function. Optimization Methods & Software, 18(6), 631-646 (2003)
15. Bai, Y. Q., Wang, G. Q., Roos, C.: A new primal-dual interior-point algorithm for second-order cone optimization, Submision to Optimization, 2006
16. Sonnevend, G.: An "analytic center" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In Prékopa, A. Szelezsán, J. and Strazicky, B. Eds. System Modelling and Optimization : Proceedings of the 12th IFIP-Conference held in Budapest, Hungary, September 1985, volume 84 of Lecture Notes in Control and Information Sciences, Springer-Verlag, Berlin, West Germany, 1986, 866-876