✦ LIBER ✦

Superlinear convergence of infeasible-interior-point methods for linear programming

✍ Scribed by Yin Zhang; Detong Zhang

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 857 KB
Volume: 66
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Superlinear and quadratic convergence of

Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited

✍ Y. Zhang; R. A. Tapia 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 769 KB

Polynomiality of infeasible-interior-poi

Polynomiality of infeasible-interior-point algorithms for linear programming

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

Improving the rate of convergence of int

Improving the rate of convergence of interior point methods for linear programming

✍ Vera V. Kovacevic-Vujcic 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 549 KB

A primal-dual infeasible-interior-point

A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems

✍ Huang Hui; Fei Pu-sheng; Yuan Yuan 📂 Article 📅 2005 🏛 Wuhan University 🌐 English ⚖ 290 KB

On the finite convergence of interior-po

On the finite convergence of interior-point algorithms for linear programming

✍ Yinyu Ye 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 631 KB

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