✦ LIBER ✦

Algorithms for proximity problems in higher dimensions

✍ Scribed by Matthew T. Dickerson; David Eppstein

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 804 KB
Volume: 5
Category: Article
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00009-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The exact fitting problem in higher dime

The exact fitting problem in higher dimensions

✍ Leonidas J. Guibas; Mark H. Overmars; Jean-Marc Robert 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 967 KB

A proximal point algorithm for control a

A proximal point algorithm for control approximation problems

✍ H. Benker; A. Hamel; C. Tammer 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 555 KB

The modular n-queens problem in higher d

The modular n-queens problem in higher dimensions

✍ Scott P. Nudelman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 340 KB

A self-adjoint problem for the wave equa

A self-adjoint problem for the wave equation in higher dimensions

✍ Kurt Kreith 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 157 KB

An interior proximal point algorithm for

An interior proximal point algorithm for nonlinear complementarity problems

✍ Abdellah Bnouhachem; Muhammad Aslam Noor 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 321 KB

In this paper, we propose a new method for solving nonlinear complementarity problems (NCP), where the underlying function F is pseudomonotone and continuous. The method can be viewed as an extension of the method of Noor and Bnouhachem (2006) [13], by performing an additional projection step at eac

A domain decomposition algorithm for ell

A domain decomposition algorithm for elliptic problems in three dimensions

✍ Barry F. Smith 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 689 KB