Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers

This paper first investigates Newton-type methods for generalized equations with compact solution sets. The analysis of their local convergence behavior is based, besides other conditions, on the upper Lipschitz-continuity of the local solution set mapping of a simply perturbed generalized equation. This approach is then applied to the KKT conditions of a nonlinear program with inequality constraints and leads to a modified version of the classical Wilson method. It is shown that the distances of the iterates to the set of KKT points converge q-quadratically to zero under conditions that do not imply a unique multiplier vector. Additionally to the Mangasarian-Fromovitz Constraint Qualification and to a Second-Order Sufficiency Condition the local minimizer is required to fulfill a Constant Rank Condition (weaker than the Constant Rank Constraint Qualification one of Janin) and a so-called Weak Complementarity Condition.

[1]  Stephen J. Wright.  Superlinear Convergence of a Stabilized SQP Method to a Degenerate Solution , 1998, Comput. Optim. Appl..

[2]  Zengxin Wei,et al.  On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods , 1999, SIAM J. Optim..

[3]  Stephen J. Wright,et al.  Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints , 2000, Math. Oper. Res..

[4]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[5]  S. M. Robinson.  Generalized equations and their solutions, part II: Applications to nonlinear programming , 1982 .

[6]  J. F. Bonnans,et al.  Local analysis of Newton-type methods for variational inequalities and nonlinear programming , 1994 .

[7]  Stephen J. Wright,et al.  Superlinear convergence of an interior-point method for monotone variational inequalities , 1996 .

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

[9]  Jong-Shi Pang,et al.  Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results , 1993, Math. Program..

[10]  R. Janin.  Directional derivative of the marginal function in nonlinear programming , 1984 .

[11]  Stephen M. Robinson,et al.  Strongly Regular Generalized Equations , 1980, Math. Oper. Res..

[12]  William W. Hager,et al.  Stability in the presence of degeneracy and error estimation , 1999, Math. Program..

[13]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

[14]  J. F. Bonnans.  Local study of Newton type algorithms for constrained problems , 1988 .

[15]  S. M. Robinson.  Extension of Newton's method to nonlinear functions with values in a cone , 1972 .

[16]  S. M. Robinson.  Some continuity properties of polyhedral multifunctions , 1981 .

[17]  André L. Tits,et al.  On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..

[18]  William W. Hager,et al.  Stabilized Sequential Quadratic Programming , 1999, Comput. Optim. Appl..

[19]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[20]  N. Josephy.  Newton's Method for Generalized Equations. , 1979 .

[21]  Francisco Facchinei,et al.  On the Accurate Identification of Active Constraints , 1998, SIAM J. Optim..

[22]  Francisco Facchinei,et al.  Regularity Properties of a Semismooth Reformulation of Variational Inequalities , 1998, SIAM J. Optim..

[23]  S. Lucidi,et al.  Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems , 1995 .

[24]  K. Vetters.  Quadratische Approximationsmethoden zur konvexen Optimierung , 1970 .