ScholarLens Back to search
2006•Journal of Henan Normal UniversityRequires access

A High-Order Wide Neighborhood Interior-Point Algorithm for Solving P_*(τ) Matrix Linear Complementarity Problem

Mingwang Zhang

Open publisher page 0 citations

Abstract

This paper provides a wide neighborhood interior-point algorithm-high-order for solving P_*(τ) matrix linear complementary problems.On the basis of the idea of primal-dual affine scaling method for linear programming,the search direction of our algorithm is obtained by a linear system of equation at each iteration.And we choose an appropriate step size,such that the algorithm has polynomial time complexity.

About this research paper

What this paper is about

This paper provides a wide neighborhood interior-point algorithm-high-order for solving P_*(τ) matrix linear complementary problems.On the basis of the idea of primal-dual affine scaling method for linear programming,the search direction of our algorithm is obtained by a linear system of equation at each iteration.And we choose an appropriate step size,such that the algorithm has polynomial time complexity.

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

This paper provides a wide neighborhood interior-point algorithm-high-order for solving P_*(τ) matrix linear complementary problems.On the basis of the idea of primal-dual affine scaling method for linear programming,the search direction of our algorithm is obtained by a linear system of equation at each iteration.And we choose an appropriate step size,such that the algorithm has polynomial time complexity.

Key concepts: Interior point method, Linear complementarity problem, Algorithm, Linear programming, Mathematics, Criss-cross algorithm, Matrix (chemical analysis), Complementarity theory

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A High-Order Wide Neighborhood Interior-Point Algorithm for Solving P_*(τ) Matrix Linear Complementarity Problem — Research Paper | ScholarLens