✦ LIBER ✦

A quadratic-time algorithm for smoothing interval functions

✍ Scribed by V. Kreinovich; Karen Villaverde

Publisher: Springer
Year: 1996
Tongue: English
Weight: 677 KB
Volume: 2
Category: Article
ISSN: 1385-3139
DOI: 10.1007/bf02391699

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for constrained smoothing f

An algorithm for constrained smoothing functions

✍ M. T. Bozzini; C. Paracelli 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 339 KB

An algorithm for computing constrained s

An algorithm for computing constrained smoothing spline functions

✍ Tommy Elfving; Lars-Erik Andersson 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 517 KB

An Almost Quadratic Time Algorithm for

✍ Yoshifumi Sakai 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 772 KB

A linear time recognition algorithm for

A linear time recognition algorithm for proper interval graphs

✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian

Sub-quadratic convergence of a smoothing

Sub-quadratic convergence of a smoothing Newton algorithm for theP0– and monotone LCP

✍ Zheng-Hai Huang; Liqun Qi; Defeng Sun 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 207 KB

A new penalty function algorithm for con

A new penalty function algorithm for convex quadratic programming

✍ M. Ben-Daya; K.S. Al-Sultan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 607 KB

In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e