✦ LIBER ✦

Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming

✍ Scribed by Weichung Wang; Dianne P. O'Leary

Book ID: 110350462
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 134 KB
Volume: 25
Category: Article
ISSN: 1017-1398
DOI: 10.1023/a:1016614603137

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adaptive Large-Neighborhood Self-Regular

Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization

✍ M. Salahi; T. Terlaky 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 206 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

Superlinear convergence of infeasible-in

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

✍ Yin Zhang; Detong Zhang 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 857 KB

Sensitivity analysis in linear programmi

Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

✍ E. Alper Yıldırım; Michael Todd 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 277 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

Integrability of vector and multivector

Integrability of vector and multivector fields associated with interior point methods for linear programming

✍ Masao Iri 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 691 KB