2009•Shuxue de shijian yu renshiRequires access

A New Wide-Neighborhood Predictor-Corrector Interior-Point Algorithm for the P*(κ)-matrix Linear Complementarity Problem

Mingwang Zhang

Abstract

Via least value of proximity measure function,a new wide-neighborhood predictor-corrector interior-point algorithm for P*(κ)-matrix linear complementarity problem is proposed,we also prove that its iteration complexity is O((κ+1)32nlog(x0)Ts0e).Our algorithm is not only a version of Miao′s Mizuno-Todd-Ye predictor-corrector interior-point algorithm for P*(κ)-matrix linear complementarity problem,but also an extension of Zhao′s wide-neighborhood interior-point algorithm for linear programming via least value of proximity measure function.

About this research paper

What this paper is about

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

Key concepts: Interior point method, Predictor–corrector method, Linear complementarity problem, Mathematics, Complementarity (molecular biology), Linear programming, Algorithm, Complementarity theory