Abstract
In this paper, we present a primal-dual interior point algorithm for semidefinite optimization problems based on a new class of kernel functions. These functions constitute a combination of the classic kernel function and a barrier term.
We derive the complexity bounds for large and small-update methods respectively. We show that the best result of iteration bounds for large and small-update methods can be achieved, namely \(O\left({q\sqrt n {{\left({\log \sqrt n} \right)}^{{{q + 1} \over q}}}\log {n \over \varepsilon}} \right)\) for large-update methods and \(O\left({{q^{{3 \over 2}}}{{\left({\log \sqrt n} \right)}^{{{q + 1} \over q}}}\sqrt n \log {n \over \varepsilon}} \right)\) for small-update methods.
We test the efficiency and the validity of our algorithm by running some computational tests, then we compare our numerical results with results obtained by algorithms based on different kernel functions.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alizadeh, F. Interior-point methods in semi-definite programming with applications to combinatorial optimization. SIAM J. Optim., 5: 13–51 (1995)
Amini, K., Haseli, A. A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods. ANZIAM Journal, 49(2): 259–270 (2007)
Bai, Y.Q., El Ghami, M., Roos, C. A new efficient large update interior-point method based a finite barrier. SIAM Journal on Optimization, 13(3): 766–782 (2003)
Bai, Y.Q., El Ghami, M., Roos, C. A comparative study of proximity functions for primal-dual interior-point algorithms in linear optimization. SIAM Journal on Optimization, 15(1): 101–128 (2004)
Bai, Y.Q., Lesaja, G., Roos, C., Wang, G. Q., El Ghami, M. A class of large-update and small-update primal-dual interior-point algorithms for linear optimization. Journal of Optimization Theory and Applications, 138(3): 341–359 (2008)
Cai, X.Z., Li, L., El Ghami, M., Steihaug, T., Wang, G.Q. A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian P* (κ)-LCP over symmetric cones. Pacific Journal of Optimization, 13(4): 547–570 (2017)
Choi, B.K., Kee, G.M. On complexity analysis of the primal-dual interior-point method for semideflnite optimization problem based on a new proximity function. Nonlinear Anal., 71(12): 2540–2550 (2009)
DeKlerk, E. Aspects of Semideflnite Programming. Applied Optimization, Vol. 65. Kluwer Academic, Dordrecht, 2002
Derbal, L., Kebbiche, Z. Theoretical and Numerical Result for Linear Optimization. Journal of Siberian Federal University. Mathematics & Physics, 12(2): 160–172 (2019)
EI Ghami, M. Primal-dual algorithms for semideflnite optimization problems based on generalized trigonometric barrier function. International Journal of Pure and Applied Mathematics, 114(4): 797–818 (2017)
El Ghami, M., Guennoun, Z. A., Bouali, S., Steihaug, T. Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. Journal of Computational and Applied Mathematics, 236(15): 3613–3623 (2012)
Horn, R.A., Charles, R.J. Matrix Analysis. Cambridge University Press, UK, 1986
Kojima, M., Shida, M., Hará, S. Interior point methods for the monotone semideflnite linear complementarity problem in symmetric matrices. SIAM J. Optim., 7: 86–125 (1997)
Liu, L., Li, S. A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods. Journal of Computational and Applied Mathematics, ??, 2011
Nesterov, Y.E., Nemirovskii, A.S. Interior point polynomial algorithms in convex programming. In: SIAM Stud. Appl. Math., Vol. 13. SIAM, Philadelphia, 1994
Peng, J., Roos, C., Terlaky, T. Self-regular proximities and new search directions for linear and semideflnite optimization. Mathematical Programming, 2002, 93(A): 129–171
Peng, J., Roos, C., Terlaky, T. Self-regularity: A New Paradigm for Primal-dual Interior-point Algorithms. Princeton University Press, New Jersey, 2002
Peyghami, M.R., Hafshejani, S.F. Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function. Numerical Algorithms, 2014
Peyghami, M.R., Hafshejani, S.F., Shirvani, L. Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. Journal of Computational and Applied Mathematics, 255(1): 74–85 (2014)
Roos, C., Terlaky, T., Vial, J. Ph. Theory and Algorithms for Linear Optimization. An Interior-Point Approach. John Wiley & Sons, Chichester, UK, 1997
Sturm, J.F., Zhang, S. Symmetric primal-dual path following algorithms for semideflnite programming. Appl. Num. Math., 29: 301–315 (1999)
Todd, M.J., Toh, K.C., Tüt ünc ü, R. H. The Nesterov-Todd directions in semideflnite programming. SIAM Journal on Optimization, 8(3): 769–796 (1998)
Todd, M.J. A study of search directions in primal-dual interior-point methods for semideflnite programming. Optim. Methods Softw., 11, 1–46 (1999)
Wang, G.Q., Bai, Y.Q. A class of polynomial primal-dual interior-point algorithms for semideflnite optimization. Journal of Shanghai University (English Edition), 10(3): 198–207 (2006)
Wang, G.Q., Lesaja, G. Full Nesterov-Todd step feasible interior-point method for the Cartesian P*(κ)-SCLCP. Optim. Methods Softw., 28(3): 600–618 (2013)
Wang, G.Q., Bai, Y.Q., Roos, C. Primal-dual interior point algorithms for semideflnite optimization based on a simple kernel function. Journal of Mathematical Modelling and Algorithms, 4(4): 409–433 (2005)
Wolkowicz, H., Saigal, R., Vandenberghe, L. Handbook of Semideflnite Programming: Theory, Algorithms, and Applications. Kluwer Academic Publishers, Dordrecht, 2000
Zhang, M.W. A Large-update Interior-point Algorithm for Convex Quadratic Semi-definite Optimization Based on a New Kernel Function. Acta Mathematica Sinica, English Series, 28(11): 2313–2328 (2012)
Zhang, Y. On extending some primal dual algorithms from linear programming to semideflnite programming. SIAM J. Optim., 8: 365–386 (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Derbal, L., Kebbiche, Z. An Efficient Parameterized Logarithmic Kernel Function for Semidefinite Optimization. Acta Math. Appl. Sin. Engl. Ser. 36, 753–770 (2020). https://doi.org/10.1007/s10255-020-0955-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-020-0955-y
Keywords
- kernel function
- interior-point algorithms
- semidefinite optimization
- complexity bound
- primal-dual methods