✦ LIBER ✦

A critical index algorithm for nearest point problems on simplicial cones

✍ Scribed by Katta G. Murty; Yahya Fathi

Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 442 KB
Volume: 23
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01583789

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simplicial homotopy algorithm for comp

A simplicial homotopy algorithm for computing zero points on polytopes

✍ Kaizhou Chen; Zaifu Yang; Zhengli Liang 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 568 KB

Efficient algorithms for computing two n

Efficient algorithms for computing two nearest-neighbor problems on a rap

✍ Tzong-Wann Kao; Shi-Jinn Horng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 782 KB

A class of polynomial interior-point alg

A class of polynomial interior-point algorithms for the Cartesian second-order cone linear complementarity problem

✍ G.Q. Wang; D.T. Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 513 KB

A note on bifurcation points for index-1

A note on bifurcation points for index-1 differential-algebraic problems

✍ Y Ren; A Spence 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 154 KB

The arclength continuation method is proposed for index-1 DAEs with singular points. In particular, the cusp points, the tangency points and equilibrium points are investigated. The numerical iterative matrix is studied at a singular point. The numerical examples are given to illustrate the robustn

On a three critical points theorem for n

On a three critical points theorem for non-differentiable functions and applications to nonlinear boundary value problems

✍ Salvatore A. Marano; Dumitru Motreanu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Polynomial-time algorithms for solving a

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views