✦ LIBER ✦

Linear time algorithms for some separable quadratic programming problems

✍ Scribed by Nimrod Megiddo; Arie Tamir

Book ID: 107918260
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 440 KB
Volume: 13
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(93)90041-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparsity-preserving sor algorithms for s

Sparsity-preserving sor algorithms for separable quadratic and linear programming

✍ O.L. Mangasarian 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Quadratic programming algorithms for obs

Quadratic programming algorithms for obstacle problems

✍ Doukhovni, Ilia ;Givoli, Dan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 446 KB

The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems

Linear time algorithms for linear progra

Linear time algorithms for linear programming

✍ E.A. Galperin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Some Randomized Algorithms for Convex Qu

Some Randomized Algorithms for Convex Quadratic Programming

✍ R. Goldbach 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 271 KB

Some algorithms for solving non-linear i

Some algorithms for solving non-linear integer mathematical programming problems

✍ Y.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 455 KB

On Linear-Time Algorithms for the Contin

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

✍ K. C. Kiwiel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 208 KB