Paper Title:
An Efficient Algorithm for Linear Complementarity Problems
  Abstract

Through some modifications on the classical-Newton direction, we obtain a new searching direction for monotone horizontal linear complementarity problem. By taking the step size along this direction as one, we set up a full-step primal-dual interior-point algorithm for monotone horizontal linear complementarity problem. The complexity bound for the algorithm is derived, which is the best-known for linear complementarity problem.

  Info
Periodical
Advanced Materials Research (Volumes 204-210)
Edited by
Helen Zhang, Gang Shen and David Jin
Pages
687-690
DOI
10.4028/www.scientific.net/AMR.204-210.687
Citation
L. P. Zhang, Y. H. Xu, "An Efficient Algorithm for Linear Complementarity Problems", Advanced Materials Research, Vols. 204-210, pp. 687-690, 2011
Online since
February 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Long Quan Yong
Abstract:This text studies a kind of obstacle problem. Combining with difference principle, we transform the original problem into monotone linear...
725
Authors: Long Quan Yong
Chapter 2: Simulation and Engineering Optimization
Abstract:A new method is proposed for the linear complementarity problem (LCP). Firstly we formulate the LCP into a multiobjective optimization...
236
Authors: Jie Gao
Chapter 3: Communication, Information Science and Data Processing, Mechatronics and Control
Abstract:In this paper, by using Leggett-Williams fixed point theorem, we will study the existence of positive solutions for a class of multi-point...
303