Skip to main content
Log in

A Simply Constrained Optimization Reformulation of KKT Systems Arising from Variational Inequalities

  • Published:
Applied Mathematics and Optimization Submit manuscript

Abstract.

The Karush—Kuhn—Tucker (KKT) conditions can be regarded as optimality conditions for both variational inequalities and constrained optimization problems. In order to overcome some drawbacks of recently proposed reformulations of KKT systems, we propose casting KKT systems as a minimization problem with nonnegativity constraints on some of the variables. We prove that, under fairly mild assumptions, every stationary point of this constrained minimization problem is a solution of the KKT conditions. Based on this reformulation, a new algorithm for the solution of the KKT conditions is suggested and shown to have some strong global and local convergence properties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Author information

Authors and Affiliations

Authors

Additional information

Accepted 10 December 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Facchinei, F., Fischer, A., C. Kanzow, . et al. A Simply Constrained Optimization Reformulation of KKT Systems Arising from Variational Inequalities . Appl Math Optim 40, 19–37 (1999). https://doi.org/10.1007/s002459900114

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002459900114

Navigation