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

A new large-update interior point algorithm for linear complementarity problems

โœ Scribed by Gyeong-Mi Cho

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
190 KB
Volume
216
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 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