Feasible descent algorithms for mixed complementarity problems |
| |
| Authors: | Michael C. Ferris Christian Kanzow Todd S. Munson |
| |
| Affiliation: | (1) University of Wisconsin – Madison, Computer Sciences Department, 1210 West Dayton Street, Madison, WI 53706, USA, e-mail: ferris@cs.wisc.edu, US;(2) University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-20146 Hamburg, Germany, e-mail: kanzow@math.uni-hamburg.de, DE;(3) University of Wisconsin – Madison, Computer Sciences Department, 1210 West Dayton Street, Madison, WI 53706, USA, e-mail: tmunson@cs.wisc.edu, US |
| |
| Abstract: | In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-defined for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This framework is applied to the PATH solver in order to show viability of the approach. Numerical results for an appropriate modification of the PATH solver indicate that this framework leads to substantial computational improvements. Received April 9, 1998 / Revised version received November 23, 1998?Published online March 16, 1999 |
| |
| Keywords: | : mixed complementarity problems – global convergence – superlinear convergence – feasible descent methods |
| 本文献已被 SpringerLink 等数据库收录！ |
|
