An infeasible interior-point arc-search algorithm for nonlinear constrained optimization

In this paper, we propose an infeasible arc-search interior-point algorithm for solving nonlinear programming problems. Most algorithms based on interior-point methods are categorized as line search since they compute a next iterate on a straight line determined by a search direction which approximates the central path. The proposed arc-search interior-point algorithm uses an arc for the approximation. We discuss convergence properties of the proposed algorithm. We also conduct numerical experiments on the CUTEst benchmark problems and compare the performance of the proposed arc-search algorithm with that of a line-search algorithm. Numerical results indicate that the proposed arc-search algorithm reaches the optimal solution using fewer iterations but longer times than a line-search algorithm. A modification that leads to a faster arc-search algorithm is also discussed.

[1]  T. Lu,et al.  Inverses of 2 × 2 block matrices , 2002 .

[2]  Gongyun Zhao,et al.  Analytical Properties of the Central Trajectory in Interior Point Methods , 1994 .

[3]  Arne Stolbjerg Drud,et al.  CONOPT - A Large-Scale GRG Code , 1994, INFORMS J. Comput..

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

[5]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

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

[7]  Andreas Wächter,et al.  A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties , 2003, SIAM J. Optim..

[8]  Stefan Ulbrich,et al.  A globally convergent primal-dual interior-point filter method for nonlinear programming , 2004, Math. Program..

[9]  Yaguang Yang.  A polynomial arc-search interior-point algorithm for convex quadratic programming , 2011, Eur. J. Oper. Res..

[10]  Yiyuan Zhou,et al.  A primal-dual interior-point algorithm with arc-search for semidefinite programming , 2019, Optimization Letters.

[11]  T. Tsuchiya,et al.  On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .

[12]  Nicholas I. M. Gould,et al.  CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization , 2013, Computational Optimization and Applications.

[13]  Anders Forsgren,et al.  Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..

[14]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..

[15]  Makoto Yamashita,et al.  An arc-search $${\mathcal {O}}(nL)$$O(nL) infeasible-interior-point algorithm for linear programming , 2015, Optim. Lett..

[16]  Nicholas I. M. Gould,et al.  A Note on Performance Profiles for Benchmarking Software , 2016, ACM Trans. Math. Softw..

[17]  Todd Plantenga,et al.  A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques , 1998, SIAM J. Sci. Comput..

[18]  Hongwei Liu,et al.  An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path , 2016, Optimization Letters.

[19]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[20]  Yaguang Yang,et al.  Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming , 2016, Numerical Algorithms.

[21]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[22]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[23]  Yaguang Yang,et al.  A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming , 2013, Journal of Optimization Theory and Applications.

[24]  Behrouz Kheirfam,et al.  An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the neighbourhood of the central path , 2017, Int. J. Comput. Math..

[25]  Yaguang Yang,et al.  CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming , 2016, Numerical Algorithms.

[26]  Jorge Nocedal,et al.  Adaptive Barrier Update Strategies for Nonlinear Interior Methods , 2008, SIAM J. Optim..

[27]  Yaguang Yang.  Arc-Search Infeasible Interior-Point Algorithm for Linear Programming , 2014, 1406.4539.

[28]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..