2007Journal of Fujian Normal UniversityRequires access

A One-step Smoothing Newton Method for P_0-NCP

Changfeng Ma

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Nonlinear complementarity problem, Smoothing, Parameterized complexity, Mathematics, Nonlinear system, Newton's method, Applied mathematics, Mixed complementarity problem

Related papers

Back to paper searchBrowse research topicsOriginal source
A One-step Smoothing Newton Method for P_0-NCP — Research Paper | ScholarLens