✦ LIBER ✦

An interior points algorithm for the convex feasibility problem

✍ Scribed by Ron Aharoni; Abraham Berman; Yair Censor

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 433 KB
Volume: 4
Category: Article
ISSN: 0196-8858
DOI: 10.1016/0196-8858(83)90019-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Interior-Point Algorithm for Nonlinea

An Interior-Point Algorithm for Nonlinear Minimax Problems

✍ E. Obasanjo; G. Tzallas-Regas; B. Rustem 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 779 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

An infeasible-interior-point algorithm f

An infeasible-interior-point algorithm for linear complementarity problems

✍ Stephen J. Wright 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 919 KB

Extrapolation algorithm for affine-conve

Extrapolation algorithm for affine-convex feasibility problems

✍ Heinz H. Bauschke; Patrick L. Combettes; Serge G. Kruk 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 596 KB

An interior-point algorithm for elastopl

An interior-point algorithm for elastoplasticity

✍ K. Krabbenhoft; A. V. Lyamin; S. W. Sloan; P. Wriggers 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

An interior point potential reduction al

An interior point potential reduction algorithm for the linear complementarity problem

✍ Masakazu Kojima; Nimrod Megiddo; Yinyu Ye 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 562 KB