Jacobian Smoothing Methods for Nonlinear Complementarity Problems
نویسندگان
چکیده
We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementarity problem as a nonsmooth system of equations by using the Fischer-Burmeister function. We use an idea by Chen, Qi and Sun and apply a Jacobian smoothing method (which is a mixture between nonsmooth Newton and smoothing methods) in order to solve this system. In contrast to Chen, Qi and Sun, however, our method is at least well-defined for general complementarity problems. Extensive numerical results indicate that the new algorithm works very well. In particular, it can solve all nonlinear complementarity problems from the MCPLIB and GAMSLIB libraries.
منابع مشابه
A Jacobian Smoothing Nonlinear Complementarity Method for Solving Nonlinear Optimal Power Flows
The paper presents a Jacobian smoothing nonlinear complementarity method for solving large nonlinear optimal power flow (OPF) problems. By using (smooth or non-smooth) nonlinear complementarity (NC) functions we reformulate the OPF problem as a (smooth or non-smooth) nonlinear system of equations, which, in turn, can be solved by well-known methods. The Jacobian smoothing method computes the se...
متن کاملJacobian Smoothing Methods for General Nonlinear Complementarity Problems
We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementar-ity problem as a nonsmooth system of equations by using the Fischer-Burmeister function. We use an idea by Chen, Qi and Sun and apply a Jacobian smoothing method (which is a mixture between nonsmooth Newton and smoothing method...
متن کاملJacobian Smoothing Inexact Newton Method for Ncp with a Special Choice of Forcing Parameters
The inexact Newton method with a special choice of forcing parameters is proposed for solving nonlinear complementarity problems. This method belongs to the class of Jacobian smoothing methods. Linear system is solved approximately in every iteration. The sequence of forcing terms controls the accuracy level of the approximate solution and influences the behavior of the method. Globalization st...
متن کاملA Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...
متن کاملGlobally convergent Jacobian smoothing inexact Newton methods for NCP
A new smoothing algorithm for the solution of nonlinear complementarity problems (NCP) is introduced in this paper. It is based on semismooth equation reformulation of NCP by Fischer–Burmeister function and its related smooth approximation. In each iteration the corresponding linear system is solved only approximately. Since inexact directions are not necessarily descent, a nonmonotone techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 9 شماره
صفحات -
تاریخ انتشار 1999