๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An interior point potential reduction algorithm for the linear complementarity problem

โœ Scribed by Masakazu Kojima; Nimrod Megiddo; Yinyu Ye

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
562 KB
Volume
54
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An interior proximal point algorithm for
An interior proximal point algorithm for nonlinear complementarity problems
โœ Abdellah Bnouhachem; Muhammad Aslam Noor ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier ๐ŸŒ English โš– 321 KB

In this paper, we propose a new method for solving nonlinear complementarity problems (NCP), where the underlying function F is pseudomonotone and continuous. The method can be viewed as an extension of the method of Noor and Bnouhachem (2006) [13], by performing an additional projection step at eac

Complexity of large-update interior poin
Complexity of large-update interior point algorithm for linear complementarity problems
โœ G.M. Cho; M.K. Kim; Y.H. Lee ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 274 KB

In this paper we propose a new large-update primal-dual interior point algorithm for P \* (ฮบ) linear complementarity problems (LCPs). We extend Bai et al.'s primal-dual interior point algorithm for linear optimization (LO) problems to P \* (ฮบ) LCPs with generalized kernel functions. New search direc

An interior point method for the nonline
An interior point method for the nonlinear complementarity problem
โœ Alfredo Noel Iusem ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 664 KB

We present an interior point method for the nonlinear complementarity problem which converges, whenever the problem has solutions, for any paramonotone operator (i.e., monotone and such that (F(x) -F(y), x-y) = 0 implies F(x) = F(y)). The iterative step consists of easily computable closed formulae,