Browse > Article
http://dx.doi.org/10.4134/CKMS.c160133

A WEIGHTED-PATH FOLLOWING INTERIOR-POINT ALGORITHM FOR CARTESIAN P∗(κ)-LCP OVER SYMMETRIC CONES  

Mansouri, Hossein (Department of Applied Mathematics Faculty of Mathematical Sciences Shahrekord University)
Pirhaji, Mohammad (Department of Applied Mathematics Faculty of Mathematical Sciences Shahrekord University)
Zangiabadi, Maryam (Department of Applied Mathematics Faculty of Mathematical Sciences Shahrekord University)
Publication Information
Communications of the Korean Mathematical Society / v.32, no.3, 2017 , pp. 765-778 More about this Journal
Abstract
Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.
Keywords
linear complementarity problems; the Cartesian property; path following algorithm; polynomial complexity;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Achache, A new primal-dual path-following method for convex quadratic programming, Comput. Appl. Math, 25 (2006), no. 1, 97-110.
2 Z. Darvay, A weighted-path-following method for linear optimization, Stud. Univ. Babes-Bolyai Inform. 47 (2002), no. 2, 3-12.
3 Z. Darvay, New interior point algorithms in linear programming, Adv. Model. Optim. 5 (2003), no. 1, 51-92.
4 J. Faraut and A. Koranyi, Analysis on Symmetric Cones, Oxford University Press, New York, 1994.
5 L. Faybusovich, Euclidean Jordan algebras and interior-point algorithms, Positivity 1 (1997), no. 4, 331-357.   DOI
6 L. Faybusovich, A Jordan-algebraic approach to potential-reduction algorithms, Math. Z. 239 (2002), no. 1, 117-129.   DOI
7 G. Gu, M. Zangiabadi, and C. Roos, Full Nesterov-Todd step interior-point methods for symmetric optimization, European J. Oper. Res. 214 (2011), no. 3, 473-484.   DOI
8 B. Jansen, C. Roos, T. Terlaky, and J. Vial, Long-step primal-dual target-following algorithms for linear programming, Math. Methods Oper. Res. 44 (1996), no. 1, 11-30.   DOI
9 M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, vol. 538. Springer, New York, 1991.
10 Z. Y. Luo and N. H. Xiu, Path-following interior-point algorithms for the Cartesian $P_{\ast}{\kappa}$-LCP over symmetric cones, Sci. China Math. 52 (2009), no. 8, 1769-1784.   DOI
11 H. Mansouri and M. Pirhaji, A polynomial interior-point algorithm for linear complementarity problems, J. Optim. Theory Appl. 157 (2013), no. 2, 451-461.   DOI
12 H. Mansouri, M. Zangiabadi, and M. Pirhaji, A full-Newton step O(n) infeasible interior-point algorithm for linear complementarity problems, Nonlinear Anal. Real World Appl. 12 (2011), no. 1, 545-561.   DOI
13 F. A. Potra, An infeasible interior point method for linear complementarity problems over symmetric cones, Proceedings of the 7th International Conference of Numerical Analysis and Applied Mathematics, Rethymno, Crete, Greece, 18-22 September 2009, pp. 1403-1406. Am. Inst. of Phys., New York, 2009.
14 B. K. Rangarajan, Polynomial convergence of infeasible-interior-point methods over symmetric cones, SIAM J. Optim. 16 (2006), no. 4, 1211-1229.   DOI
15 C. Roos, A full-Newton step O(n) infeasible interior-point algorithm for linear optimization, SIAM J. Optim. 16 (2006), no. 4, 1110-1136.   DOI
16 S. H. Schmieta and F. Alizadeh, Extension of primal-dual interior-point algorithms to symmetric cones, Math. Program. 96 (2003), no. 3, 409-438.   DOI
17 J. F. Sturm, Similarity and other spectral relations for symmetric cones, Linear Algebra Appl. 312 (2000), no. 1-3, 135-154.   DOI
18 G. Q. Wang and Y. Q. Bai, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Appl. Math. Comput. 215 (2009), no. 3, 1047-1061.   DOI
19 G. Q. Wang and Y. Q. Bai, A new primal-dual path-following interior-point algorithm for semidefinite optimization, J. Math. Anal. Appl. 353 (2009), no. 1, 339-349.   DOI
20 G. Q. Wang and Y. Q. Bai, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, J. Optim. Theory Appl. 154 (2012), no. 3, 966-985.   DOI
21 G. Q. Wang and Y. Q. Bai, A class of polynomial interior-point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, J. Optim. Theory Appl. 152 (2012), no. 3, 739-772.   DOI
22 G. Q. Wang and G. Lesaja, Full Nesterov-Todd step feasible interior-point method for the Cartesian $P_{\ast}{\kappa}$-SCLCP, Optim. Methods Softw. 28 (2013), no. 3, 600-618.   DOI
23 A. Yoshise, Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones, SIAM J. Optim. 17 (2006), no. 4, 1129-1153.   DOI
24 Y. B. Zhao and J. Han, Two interior-point methods for nonlinear $P_{\ast}{\kappa}$-complementaritarity problems, J. Optim. Theory Appl. 102 (1999), no. 3, 659-679.   DOI
25 M. V. C. Vieira, Jordan Algebraic Approach to Symetric Optimization, PhD thesis, Delft University of Thecnology, 2007.