Paper Title:
A New Searching Direction for Linear Complementarity Problems
  Abstract

In this paper, we investigate the properties of a simple function. As an application, we present a full-step interior-point algorithm for linear complementarity problem. The algorithm uses the simple function to determine the searching direction and define the neighborhood of central path. The full-step used in the algorithm has local quadratic convergence property according to the proximity function which is also constructed by this simple function. We derive the iteration complexity for the algorithm and obtain the best-known iteration bounds for linear complementarity problem.

  Info
Periodical
Advanced Materials Research (Volumes 219-220)
Edited by
Helen Zhang, Gang Shen and David Jin
Pages
1089-1092
DOI
10.4028/www.scientific.net/AMR.219-220.1089
Citation
L. P. Zhang, Y. H. Xu, "A New Searching Direction for Linear Complementarity Problems", Advanced Materials Research, Vols. 219-220, pp. 1089-1092, 2011
Online since
March 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: Hua Jiang, Tong Lai Liu, Han Lei He
Abstract:Based on the establishment of data warehouse of the decision support model of the SMT assembling quality control, this paper relies its basis...
704
Authors: Guo Jun Zhang, Chen Yang Xue, Xiao Yao Wang, Ji Jun Xiong, Wen Dong Zhang
Abstract:A novel MEMS vector hydrophone with bionics structure was introduced in 2007. As the acoustic-electric transducer infrastructure and the...
539
Authors: Guo Xing Peng, Bei Li
Abstract:Improved learning algorithm for branch and bound for semi-supervised support vector machines is proposed, according to the greater difference...
1
Authors: Zhi Wei Tang, Xi Xuan Wu
Abstract:This article introduces an intelligent surveillance distributed system based on TMS320DM642. The system platform has many functions, such as...
392