New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function

Abstract We define a new interior-point method (IPM), which is suitable for solving symmetric optimization (SO) problems. The proposed algorithm is based on a new search direction. In order to obtain this direction, we apply the method of algebraically equivalent transformation on the centering equation of the central path. We prove that the associated barrier cannot be derived from a usual kernel function. Therefore, we introduce a new notion, namely the concept of the positive-asymptotic kernel function. We conclude that this algorithm solves the problem in polynomial time and has the same complexity as the best known IPMs for SO.

[1]  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..

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

[3]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[4]  Florian A. Potra,et al.  Predictor-corrector algorithm for solvingP*(κ)-matrix LCP from arbitrary positive starting points , 1996, Math. Program..

[5]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[6]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[7]  Tibor Illés,et al.  A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems , 2007, Eur. J. Oper. Res..

[8]  J. Faraut,et al.  Analysis on Symmetric Cones , 1995 .

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

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

[11]  Zsolt Darvay,et al.  Complexity analysis of a full-Newton step interior-point method for linear optimization , 2016, Periodica Mathematica Hungarica.

[12]  Manuel V. C. Vieira,et al.  Jordan algebraic approach to symmetric optimization , 2007 .

[13]  J. Sturm.  Similarity and other spectral relations for symmetric cones , 2000 .

[14]  Behrouz Kheirfam,et al.  A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique , 2014 .

[15]  Farid Alizadeh,et al.  Extension of primal-dual interior point algorithms to symmetric cones , 2003, Math. Program..

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

[17]  Etienne de Klerk,et al.  Aspects of Semidefinite Programming , 2002 .

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

[19]  Tibor Illés,et al.  A polynomial path-following interior point algorithm for general linear complementarity problems , 2010, J. Glob. Optim..

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

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

[22]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[23]  Hossein Mansouri,et al.  A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems , 2013, J. Optim. Theory Appl..

[24]  E. D. Klerk,et al.  Aspects of semidefinite programming : interior point algorithms and selected applications , 2002 .

[25]  Michael J. Todd,et al.  Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..

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

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

[28]  Behrouz Kheirfam,et al.  A new infeasible interior-point method based on Darvay’s technique for symmetric optimization , 2013, Annals of Operations Research.

[29]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[30]  Behrouz Kheirfam.  A predictor-corrector interior-point algorithm for P∗(κ)$P_{*}(\kappa )$-horizontal linear complementarity problem , 2013, Numerical Algorithms.

[31]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[32]  Guoyong Gu,et al.  Full Nesterov-Todd step infeasible interior-point method for symmetric optimization , 2011, Eur. J. Oper. Res..

[33]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[34]  L. Faybusovich.  A Jordan-algebraic approach to potential-reduction algorithms , 2002 .

[35]  G. Q. Wang,et al.  A New Polynomial Interior-Point Algorithm for the Monotone Linear complementarity Problem over Symmetric cones with Full NT-Steps , 2012, Asia Pac. J. Oper. Res..

[36]  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.