✦ LIBER ✦

Computation of mean-semivariance efficient sets by the Critical Line Algorithm

✍ Scribed by Harry Markowitz; Peter Todd; Ganlin Xu; Yuji Yamane

Book ID: 112723813
Publisher: Springer US
Year: 1993
Tongue: English
Weight: 491 KB
Volume: 45
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02282055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient computation algorithm for calc

Efficient computation algorithm for calculating load contributions to line flows and losses

✍ Abdelkader, S. 📂 Article 📅 2006 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 177 KB

Polynomial root computation by means of

Polynomial root computation by means of the LR algorithm

✍ Luca Gemignani 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 654 KB

An efficient and provably correct algori

An efficient and provably correct algorithm for the multiscale estimation of image contours by means of polygonal lines

✍ Casadei, S.; Mitter, S. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 953 KB

Line element for efficient computation o

Line element for efficient computation of the magnetic field created by thin iron plates

✍ Brunotte, X.; Meunier, G. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 282 KB

Efficient algorithm for computing the Eu

Efficient algorithm for computing the Euler–Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities

✍ Saugata Basu 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 181 KB

Computing the equidimensional decomposit

Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

✍ Grégoire Lecerf 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 527 KB

We present a new probabilistic method for solving systems of polynomial equations and inequations. Our algorithm computes the equidimensional decomposition of the Zariski closure of the solution set of such systems. Each equidimensional component is encoded by a generic fiber, that is a finite set o