✦ LIBER ✦

A Cholesky dual method for proximal piecewise linear programming

✍ Scribed by Krzysztof C. Kiwiel

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 239 KB
Volume: 68
Category: Article
ISSN: 0029-599X
DOI: 10.1007/s002110050065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Primal and dual convergence of a proxima

Primal and dual convergence of a proximal point exponential penalty method for linear programming

✍ F. Alvarez; R. Cominetti 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 120 KB

Interior dual proximal point algorithm f

Interior dual proximal point algorithm for linear programs

✍ Rudy Setiono 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 720 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

A primal-dual simplex method for linear

A primal-dual simplex method for linear programs

✍ Norman D. Curet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Primal-Dual Simplex Method for Multiobje

Primal-Dual Simplex Method for Multiobjective Linear Programming

✍ M. Ehrgott; J. Puerto; A. M. Rodríguez-Chía 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 438 KB

An interior-point piecewise linear penal

An interior-point piecewise linear penalty method for nonlinear programming

✍ Lifeng Chen; Donald Goldfarb 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 665 KB