|
|||||
|
|
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions |
|
| Authors: | Renato DC Monteiro Takashi Tsuchiya |
| Institution: | (1) School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA, monteiro@isye.gatech.edu, US;(2) The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-Ku, Tokyo, 106, Japan, tsuchiya@sun312.ism.ac.jp, JP |
| Abstract: | Received August 29, 1996 / Revised version received May 1, 1998 Published online October 21, 1998 |
| Keywords: | : semidefinite programming – interior-point methods – polynomial complexity – path-following methods – primal-dual methods Mathematics Subject Classification (1991): 65K05 90C25 90C30 |
| 本文献已被 SpringerLink 等数据库收录！ | |