ISSN:
1572-9338
Keywords:
Linear program
;
interior point method
;
initial point
;
step length
;
complementarity problem
;
polynomial-time complexity
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract The primal-dual infeasible-interior-point algorithm is known as one of the most efficient computational methods for linear programs. Recently, a polynomial-time computational complexity bound was established for special variants of the algorithm. However, they impose severe restrictions on initial points and require a common step length in the primal and dual spaces. This paper presents some basic lemmas that bring great flexibility and improvement into such restrictions on initial points and step lengths, and discusses their extensions to linear and nonlinear monotone complementarity problems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02206809
Permalink
