The Semismooth Algorithm for Large Scale Complementarity Problems
نویسندگان
چکیده
Mathematics and Computer Sciences Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439, USA Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Buonarroti 12, 00185 Roma, Italy Computer Sciences Department, University of Wisconsin, 1210 West Dayton Street, Madison, WI 53706, USA Department of Mathematics, University of Dortmund, 44221 Dortmund, Germany Institute of Applied Mathematics, University of Hamburg, Bundesstrasse 55, 20146 Hamburg, Germany [email protected] • [email protected] • [email protected] • [email protected] • [email protected]
منابع مشابه
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
In this paper we introduce a general line search scheme which easily allows us to de ne and analyze known and new semismooth algorithms for the solution of nonlinear complementarity problems. We enucleate the basic assumptions that a search direction to be used in the general scheme has to enjoy in order to guarantee global convergence, local superlinear/quadratic convergence or nite convergenc...
متن کاملParallel Two-Grid Semismooth Newton-Krylov-Schwarz Method for Nonlinear Complementarity Problems
We develop scalable parallel domain decomposition algorithms for nonlinear complementarity problems including, for example, obstacle problems and free boundary value problems. Semismooth Newton is a popular approach for such problems, however, the method is not suitable for large scale calculations because the number of Newton iterations is not scalable with respect to the grid size; i.e., when...
متن کاملA semismooth equation approach to the solution of nonlinear complementarity problems
In this paper we present a new algorithm for the solution of nonlinear complementarity problems. The algorithm is based on a semismooth equation re-formulation of the complementarity problem. We exploit the recent extension of Newton's method to semismooth systems of equations and the fact that the natural merit function associated to the equation reformulation is continuously diieren-tiable to...
متن کاملA Penalized Fischer - Burmeister Ncp - Function : Theoretical Investigation and Numerical Results 1
We introduce a new NCP-function that reformulates a nonlinear com-plementarity problem as a system of semismooth equations (x) = 0. The new NCP-function possesses all the nice properties of the Fischer-Burmeister function for local convergence. In addition, its natural merit function (x) = 1 2 (x) T (x) has all the nice features of the Kanzow-Yamashita-Fukushima merit function for global conver...
متن کاملA Parameter-self-adjusting Levenberg-marquardt Method for Solving Nonsmooth Equations
A parameter-self-adjusting Levenberg-Marquardt method (PSA-LMM) is proposed for solving a nonlinear system of equations F (x) = 0, where F : R → R is a semismooth mapping. At each iteration, the LM parameter μk is automatically adjusted based on the ratio between actual reduction and predicted reduction. The global convergence of PSALMM for solving semismooth equations is demonstrated. Under th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 2001