In Andreani et al. (Numer. Algorithms 57:457–485, 2011), an interior point method for the horizontal nonlinear complementarity problem was introduced. This method was based on inexact Newton directions and safeguarding projected gradient iterations. Global convergence, in the sense that every cluster point is stationary, was proved in Andreani et al. (Numer. Algorithms 57:457–485, 2011). In Andreani et al. (Eur. J. Oper. Res. 249:41–54, 2016), local fast convergence was proved for the underdetermined problem in the case that the Newtonian directions are computed exactly. In the present paper, it will be proved that the method introduced in Andreani et al. (Numer. Algorithms 57:457–485, 2011) enjoys fast (linear, superlinear, or quadratic) convergence in the case of truly inexact Newton computations. Some numerical experiments will illustrate the accuracy of the convergence theory.
Horizontal complementarity problems Interior point methods Global convergence Inexact Newton method Projected gradients Local convergence
This is a preview of subscription content, log in to check access.
We are grateful to the associated editor and an anonymous referee for valuable comments and suggestions.
This work has been partially supported by the Brazilian agencies FAPESP (grants 2010/10133-0, 2013/03447-6, 2013/05475-7, 2013/07375-0, and 2014/18711-3) and CNPq (grants 309517/2014-1 and 03750/2014-6), and by the International Relationship Direction (DRI) of the University of Valle and COLCIENCIAS.
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.L.: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Program. 111, 5–32 (2008)MathSciNetCrossRefMATHGoogle Scholar
Andreani, R., Júdice, J.J., Martínez, J.M., Martini, T.: Feasibility problems with complementarity constraints. Eur. J. Oper. Res. 249, 41–54 (2016)MathSciNetCrossRefMATHGoogle Scholar
Andreani, R., Júdice, J.J., Martínez, J.M., Patricio, J.: On the natural merit function for solving complementarity problems. Math. Program. 130, 211–223 (2011)MathSciNetCrossRefMATHGoogle Scholar
Andreani, R., Júdice, J.J., Martínez, J.M., Patricio, J.: A projected-gradient interior-point algorithm for complementarity problems. Numer. Algorithms 57, 457–485 (2011)MathSciNetCrossRefMATHGoogle Scholar
Arenas, F.E., Martínez, H.J., Pérez, R.: Least change secant update methods for nonlinear complementarity problem. Ing. Cienc. 11, 11–36 (2015)CrossRefGoogle Scholar
Arias, C.A., Martínez, H.J., Pérez, R.: A global quasi-Newton algorithm for nonlinear complementarity problem. Pac. J. Optim. 13(1), 1–15 (2017)MathSciNetGoogle Scholar
Fernandes, L., Friedlander, A., Guedes, M.C., Júdice, J.: Solution of a general linear complementarity problem using smooth optimization and its applications to bilinear programming and LCP. Appl. Math. Optim 43, 1–19 (2001)MathSciNetCrossRefMATHGoogle Scholar