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

An interior proximal point algorithm for nonlinear complementarity problems

โœ Scribed by Abdellah Bnouhachem; Muhammad Aslam Noor

Publisher
Elsevier
Year
2010
Tongue
English
Weight
321 KB
Volume
4
Category
Article
ISSN
1751-570X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 each iteration and another optimal step length is employed to reach substantial progress in each iteration. We prove the global convergence of the proposed method under some suitable conditions. Some numerical results are given to illustrate the efficiency and the implementation of the new proposed method.

๐Ÿ“œ SIMILAR VOLUMES

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,

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