✦ LIBER ✦

Interior proximal point algorithm for linear programs

✍ Scribed by R. Setiono

Publisher: Springer
Year: 1992
Tongue: English
Weight: 942 KB
Volume: 74
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00940319

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interior dual proximal point algorithm f

Interior dual proximal point algorithm for linear programs

✍ Rudy Setiono 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 720 KB

Polynomiality of infeasible-interior-poi

Polynomiality of infeasible-interior-point algorithms for linear programming

✍ Shinji Mizuno 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 552 KB

An interior point algorithm for semi-inf

An interior point algorithm for semi-infinite linear programming

✍ M. C. Ferris; A. B. Philpott 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 786 KB

Interior point algorithms for linear pro

Interior point algorithms for linear programming with inequality constraints

✍ Clovis C. Gonzaga 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 700 KB

A modified layered-step interior-point a

A modified layered-step interior-point algorithm for linear programming

✍ Nimrod Megiddo; Shinji Mizuno; Takashi Tsuchiya 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 1007 KB

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