A One-step Smoothing Newton Method for P_0-NCP
Changfeng Ma
Abstract
Changfeng Ma
Abstract
It is an important approach to convert the nonlinear complementarity problem into solving a smooth equations.By introducing a new smoothing NCP-function,the problem is approximated by a family of parameterized smooth equations. A one-step smoothing Newton algorithm is presented for solving the nonlinear complementarity problem with P0-function(denoted by P0-NCP) based on the new smoothing NCP-function of generalized Fischer-Burmeister function.The proposed algorithm is proved to be well-defined and convergent globally under weaker conditions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is an important approach to convert the nonlinear complementarity problem into solving a smooth equations.By introducing a new smoothing NCP-function,the problem is approximated by a family of parameterized smooth equations. A one-step smoothing Newton algorithm is presented for solving the nonlinear complementarity problem with P0-function(denoted by P0-NCP) based on the new smoothing NCP-function of generalized Fischer-Burmeister function.The proposed algorithm is proved to be well-defined and convergent globally under weaker conditions.
Key concepts: Nonlinear complementarity problem, Smoothing, Parameterized complexity, Mathematics, Nonlinear system, Newton's method, Applied mathematics, Mixed complementarity problem