✦ LIBER ✦

An algorithm for maximizing entropy subject to simple bounds

✍ Scribed by M. J. D. Powell

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 538 KB
Volume: 42
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01589401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the entropy and its a

An upper bound for the entropy and its applications to the maximal entropy problem

✍ Y. Alhassid; N. Agmon; R.D. Levine 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 442 KB

An algorithm for maximizing a convex fun

An algorithm for maximizing a convex function over a simple set

✍ R. Enhbat 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 456 KB

On the convergence of a Jacobi-type algo

On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds

✍ Giampaolo Liuzzi; Laura Palagi; Mauro Piacentini 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 211 KB

An Optimal Simple Parallel Algorithm for

An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

✍ Shan-Chyun Ku; Biing-Feng Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th

An Algorithm to Compute Bounds for the S

An Algorithm to Compute Bounds for the Star Discrepancy

✍ Eric Thiémard 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 596 KB

An algorithm to compute maximal contract

An algorithm to compute maximal contractions for Horn clauses

✍ Jie Luo; Wei Li 📂 Article 📅 2011 🏛 Science in China Press (SCP) 🌐 English ⚖ 261 KB