### A parametric kernel function with a trigonometric barrier term for second-order cone optimization

#### Abstract

In this paper, we generalize primal-dual interior-point algorithm based on a parametric kernel function,

which was studied by M. Achache \cite{achache}, for linear optimization, to second-order cone optimization.

By using Jordan algebra, the currently best known iteration bounds for large-update methods is derived, namely,

In this paper, we generalize a primal-dual interior-point algorithm based on a parametric kernel function, which was studied by M. Achache [1], for linear optimization, to second-order cone optimization. By using Jordan algebra, the currently best known iteration bounds for large-update methods is derived, namely,.

#### Keywords

#### Full Text:

PDF#### References

M. Achache, A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm. Afrika Mat. 27, 591-601 (2015).

F. Alizadeh and D. Goldfard,Second-order cone programming. Math. Program., 95: 3-51 (2003).

M.F. Anjos, J.B. Lasserre, Handbook on Semidefinite, Conic and Polynomial Optimization: Theory, Algorithms, Software and Applications. International Series in Operational Research and Management Science. Volume 166, Springer, New York (2012).

Y.Q. Bai, M. El Ghami, and C. Roos, A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization, SIAM J. Optim., 15, 101-128 (2004).

Y.Q. Bai, G.Q. Wang, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function. Acta Mathematica Sinica, English Series, 23, 2027-2042 (2007).

Y.Q. Bai, G.Q. Wang, and C. Roos, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, Nonlinear Anal., 70, 3584-3602 (2009).

X.Z. Cai, G.Q. Wang, M. El Ghami, and Y.J. Yue, Complexity analysis of interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term, Abstr. Appl. Anal., 2014, 710158 (2014).

J. Faraut and A. Koranyi,Analysis on Symmetric Cones, Oxford University Press, New York (1994).

L. Faybusovich, A Jordan-algebraic approach to potential-reduction algorithms, Math. Z., 239, 117-129 (2002).

M.S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, Applications of the second-order cone programming, Linear Algebra Appl., 284, 193-228 (1998).

R.D.C. Monteiro and T. Tsuchiya, Polynomial convergence of primal-dual algorithms for the second-order cone programming based on the MZ-family of directions, Math. Program., 88, 61-83 (2000).

J. Peng, C. Roos, and T. Terlaky, A new class of polynomial primal-dual interior-point methods for second-order cone optimization based on self-regular proximities, SIAM J. Optim., 13, 179-203 (2002).

C. Roos, T. Terlaky, and J.-Ph. Vial, Theory and Algorithms for Linear Optimization,Springer, New York (2005).

S.H. Schmieta and F. Alizadeh, Extension of primal-dual interior-point algorithms to symmetric cones, Math. Program., 96, 409-438 (2003).

J.Y. Tang, G.P. He, and L. Fang, A new kernel function and its related properties for second-order cone optimization, Pac. J. Optim., 8, 321-346 (2012).

G.Q. Wang and Y.Q. Bai, A primal-dual path-following interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Appl. Math. Comput., 215, 1047-1061 (2009).

G.Q. Wang and Y.Q. Bai, Interior-Point Methods for Symmetric Cone Complementarity Problems: Theoretical Analysis and Algorithm Implementation. Harbin Institute of Technology Press, Harbin (2014). In Chinese

G.Q. Wang and D.T. Zhu,A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO. Numer. Algorithms, 57(4), 537-558 (2011).

### Refbacks

- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution 3.0 License.

Copyright © 2016 by** Global Publishing Corporation**

**ISSN: 2395-4760**

For any Technical Support contact us at **editor@gpcpublishing.com**, **editorglobalpublishing@gmail.com**.