✦ LIBER ✦

Algorithm/algorithmus 42 an algorithm for cubic spline fitting with convexity constraints

✍ Scribed by P. Dierckx

Publisher: Springer Vienna
Year: 1980
Tongue: English
Weight: 961 KB
Volume: 24
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02237820

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An adaptive algorithm for fitting with s

An adaptive algorithm for fitting with splines

✍ T. M. Tao; A. T. Watson 📂 Article 📅 1988 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 411 KB 👁 1 views

An algorithm for solving convex programs

An algorithm for solving convex programs with an additional convex—concave constraint

✍ Dung Le Muu 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 788 KB

An algorithm for indefinite quadratic pr

An algorithm for indefinite quadratic programming with convex constraints

✍ LêD. Muu; W. Oettli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 284 KB

An algorithm for computing solutions of

An algorithm for computing solutions of variational problems with global convexity constraints

✍ Ivar Ekeland; Santiago Moreno-Bromberg 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 700 KB

An algorithm for solving a convex progra

An algorithm for solving a convex programming problem with linear constraints

✍ B. N. Pshenichnyi; I. F. Ganzhela 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 384 KB

A Parallel Algorithm for Linear Programs

A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint

✍ Shih-Mim Liu; G.P. Papavassilopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo