ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

 
 
 
   
 
Table of Contents
   
 
2011's   29,5-6(Sept)
   
 
  POLYNOMIAL CONVERGENCE OF PREDICTOR-CORRECTOR ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS
    By FEIXIANG CHEN ..........1256
   
 
 
Generic Number - 1256
References - 0
Written Date - September 20th, 11
Modified Date - September 20th, 11
Downloaded Counts - 499
Visited Counts - 688
 
Original File
 
Summary
We establishes the polynomial convergence of a new class of
path-following methods for semidefinite linear complementarity problems
(SDLCP) whose search directions belong to the class of directions introduced by
Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the
well known algorithms for linear programming,
namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context
of SDLCP.
 
 
   
 
   

학회 : 정보전산응용수학회(KSICAM) (구: KSCAM & Korean SIGCAM)
http://www.springer.com/journal/12190
연구소 : SPCHIN 전산응용수학연구소 ( SPCHIN-CAM Institute : SPCHIN-CAMI)
Copyright ⓒ 2021 JAMC, JAMI. All rights reserved.  E-mail : sypk47@naver.com
Main Office : c/o Springer Tiergartenstrasse 17 D-69121 Heidelberg, GERMANY. www.springer.com/journal