Modified Wilson'S Method for Nonlinear Programswith Nonunique Multipliers

Authors:
Andreas Fischer
Affiliations:
-
Venue:
Mathematics of Operations Research
Year:
1999

Citing 0
Cited 4

A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions

Mathematics of Operations Research
Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints

Computational Optimization and Applications
An inexact-restoration method for nonlinear bilevel programming problems

Computational Optimization and Applications
A reduced Hessian SQP method for inequality constrained optimization

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.