A generalized direction in interior point method for monotone linear complementarity problems

In this paper, we present a new interior point method with full Newton step for monotone linear complementarity problems. The specificity of our method is to compute the Newton step using a modified system similar to that introduced by Darvay in Stud Univ Babe-Bolyai Ser Inform 47:15–26, 2017. We prove that this new method possesses the best known upper bound complexity for these methods. Moreover, we extend results known in the literature since we consider a general family of smooth concave functions in the Newton system instead of the square root.

[1]  G. Lesaja,et al.  A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization , 2008 .

[2]  Kees Roos,et al.  Unified Analysis of Kernel-Based Interior-Point Methods for P*(Kappa)-Linear Complementarity Problems , 2010, SIAM J. Optim..

[3]  Nimrod Megiddo,et al.  A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.

[4]  Mounir Haddou,et al.  Smoothing Methods for Nonlinear Complementarity Problems , 2010, J. Optim. Theory Appl..

[5]  Hossein Mansouri,et al.  On the P*(κ) horizontal linear complementarity problems over Cartesian product of symmetric cones , 2016, Optim. Methods Softw..

[6]  Tibor Illés,et al.  Polynomial affine-scaling algorithms for P*(k) linear complementary problems , 1997 .

[7]  Jiming Peng,et al.  Self-regularity - a new paradigm for primal-dual interior-point algorithms , 2002, Princeton series in applied mathematics.

[8]  X. J. Fan,et al.  New complexity analysis of a full-Newton step feasible interior-point algorithm for $$P_*(\kappa )$$P∗(κ)-LCP , 2015, Optim. Lett..

[9]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[10]  H. Mansouri,et al.  A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems , 2015 .

[11]  H. Mansouri,et al.  An infeasible interior-point method with improved centering steps for monotone linear complementarity problems , 2015 .

[12]  Yan-Qin Bai,et al.  A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization , 2012, Journal of Optimization Theory and Applications.

[13]  G. Gu.  Full-step interior-point methods for symmetric optimization , 2009 .

[14]  Mohamed Achache,et al.  Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems , 2010, Appl. Math. Comput..

[15]  Zs. Darvay,et al.  An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones , 2017 .

[16]  Hossein Mansouri,et al.  A full-Newton step O(n) infeasible-interior-point algorithm for linear complementarity problems , 2011 .

[17]  Zsolt Darvay.  New Interior Point Algorithms in Linear Programming , 2003 .

[18]  Yan-Qin Bai,et al.  Polynomial interior-point algorithms for P*(k) horizontal linear complementarity problem , 2009, J. Comput. Appl. Math..

[19]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[20]  Michael A. Saunders,et al.  An adaptive primal-dual method for linear programming , 1991 .

[21]  Yan-Qin Bai,et al.  A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step , 2009, Appl. Math. Comput..

[22]  H. Mansouri.  Full-Newton step interior-point methods for conic optimization , 2008 .

[23]  M. El Ghami,et al.  New Primal-dual Interior-point Methods Based on Kernel Functions , 2005 .

[24]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[25]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[26]  Hossein Mansouri,et al.  Polynomial interior-point algorithm for P*${(\kappa)}$ horizontal linear complementarity problems , 2012, Numerical Algorithms.

[27]  Tangi Migot,et al.  A Smoothing Method for Sparse Optimization over Polyhedral Sets , 2015, MCO.

[28]  M. Zangiabadi,et al.  A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones , 2017 .

[29]  Zsolt Darvay.  A NEW ALGORITHM FOR SOLVING SELF-DUAL LINEAR OPTIMIZATION PROBLEMS , 2002 .

[30]  Kees Roos,et al.  A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization , 2006, SIAM J. Optim..

[31]  Mohamed Achache,et al.  A new primal-dual path-following method for convex quadratic programming , 2006 .

[32]  Yan-Qin Bai,et al.  A new primal-dual path-following interior-point algorithm for semidefinite optimization , 2009 .

[33]  C. Roos.  An Improved and Simplified Full-Newton Step O(n) Infeasible Interior-Point Method for Linear Optimization , 2015, SIAM J. Optim..

[34]  C. Roos,et al.  Interior Point Methods for Linear Optimization , 2005 .