2013Zenodo (CERN European Organization for Nuclear Research)Open access

Bi-Linear Complementarity Problem

Chao Wang, Ting-Zhu Huang Chen Jia

Open full text 0 citations

Abstract

In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient.

About this research paper

What this paper is about

In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient.

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

In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient.

Key concepts: Complementarity (molecular biology), Linear complementarity problem, Mixed complementarity problem, Complementarity theory, Mathematical optimization, Mathematics, Applied mathematics, Algorithm

Back to paper searchBrowse research topicsOriginal source
Bi-Linear Complementarity Problem — Research Paper | ScholarLens