A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

AbstractThis paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998), 5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.

[1]  Jirí Vladimír Outrata,et al.  On the numerical solution of a class of Stackelberg problems , 1990, ZOR Methods Model. Oper. Res..

[2]  Jin-Bao Jian.  A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems , 1999, J. Glob. Optim..

[3]  S. M. Robinson,et al.  A quadratically-convergent algorithm for general nonlinear programming problems , 1972, Math. Program..

[4]  J. Outrata,et al.  On optimization of systems governed by implicit complementarity problems , 1994 .

[5]  J. Pang,et al.  Convergence of a Smoothing Continuation Method for Mathematical Progams with Complementarity Constraints , 1999 .

[6]  A. Fischer.  A special newton-type optimization method , 1992 .

[7]  Michal Kočvara,et al.  On the Solution of Optimum Design Problems with Variational Inequalities , 1995 .

[8]  Michal Kočvara,et al.  Nonsmooth approach to optimization problems with equilibrium constraints : theory, applications, and numerical results , 1998 .

[9]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[10]  A. Fischer.  A Newton-type method for positive-semidefinite linear complementarity problems , 1995 .

[11]  Jirí V. Outrata,et al.  A numerical approach to optimization problems with variational inequality constraints , 1995, Math. Program..

[12]  Bintong Chen,et al.  A Non-Interior-Point Continuation Method for Linear Complementarity Problems , 1993, SIAM J. Matrix Anal. Appl..

[13]  Sven Leyffer,et al.  Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints , 2006, SIAM J. Optim..

[14]  Jian Jin.  TWO EXTENSION MODELS OF SQP AND SSLE ALGORITHMS FOR OPTIMIZATION AND THEIR SUPERLINEAR AND QUADRATIC CONVERGENCE , 2001 .

[15]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[16]  Masao Fukushima,et al.  A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints , 1998, Comput. Optim. Appl..

[17]  A supermemory gradient projection algorithm for optimization problem with nonlinear constraints , 1992 .

[18]  A. Fischer.  An NCP–Function and its Use for the Solution of Complementarity Problems , 1995 .

[19]  Masao Fukushima,et al.  An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints , 2002, SIAM J. Optim..

[20]  Sven Leyffer,et al.  Solving mathematical programs with complementarity constraints as nonlinear programs , 2004, Optim. Methods Softw..

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