𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interior dual proximal point algorithm for linear programs

✍ Scribed by Rudy Setiono

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
720 KB
Volume
77
Category
Article
ISSN
0377-2217

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

Using aspiration levels in an interior p
Using aspiration levels in an interior primal-dual multiobjective linear programming algorithm
✍ Ami Arbel; Pekka Korhonen πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 784 KB

We introduce in this paper a new multiple-objective linear programming (MOLP) algorithm. The algorithm is based on the single-objective path-following primal-dual linear programming algorithm and combines it with aspiration levels and the use of achievement scalarizing functions. The resulting algor

Fast Cholesky factorization for interior
Fast Cholesky factorization for interior point methods of linear programming
✍ C. MΓ©szΓ‘ros πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 366 KB

Every iteration of an interior point method of large scale linear programming requires computing at least one orthogonal projection. In practice, Cholesky decomposition seems to be the most efficient and sufficiently stable method. We studied the 'column oriented' or 'left looking' sparse variant of

Using approximate gradients in developin
Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
✍ Ami Arbel; Shmuel S. Oren πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 841 KB

We present a new interactive multiobjective linear programming algorithm that is based on one variant of Karmarkar's algorithm known as the path-following primal-dual algorithm. The modification of this single-objective linear programming algorithm to the multiobjective case is done by deriving an a