✦ LIBER ✦

An algorithm for the linear complementarity problem with upper and lower bounds

✍ Scribed by G. Laan; A. J. J. Talman

Publisher: Springer
Year: 1989
Tongue: English
Weight: 776 KB
Volume: 62
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00939635

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper and lower bounds of the solution f

Upper and lower bounds of the solution for an elliptic plate problem using a genetic algorithm

✍ Z. -Y. Lee; C. -K. Chen; C. -I. Hung 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 467 KB

Error bounds for the linear complementar

Error bounds for the linear complementarity problem with a P-matrix

✍ Roy Mathias; Jong-Shi Pang 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Lower and upper bounds for the perturbat

Lower and upper bounds for the perturbation of linear operators equations

✍ Jiu Ding 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Let X and Y be Banach spaces, and let T : X -Y be a bounded linear operator with closed range. In this paper, we give optimal lower and upper bounds for the perturbation of consistent operator equations Tz = 1/, and more general least-squares problems in Hilbert spaces.

A heuristic algorithm for a network prob

A heuristic algorithm for a network problem with variable upper bounds

✍ Bala Shetty 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB

An upper bound for the zero-one knapsack

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views