✦ LIBER ✦

A stopping rule for optimization using randomized search procedures

✍ Scribed by K. F. Reinschmidt

Publisher: Springer
Year: 1977
Tongue: English
Weight: 333 KB
Volume: 23
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00932302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bayesian Stopping Rules for Greedy Rando

Bayesian Stopping Rules for Greedy Randomized Procedures

✍ Carlotta Orsenigo; Carlo Vercellis 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 250 KB

A stopping rule for a compound poisson r

A stopping rule for a compound poisson random variable

✍ Randolph, Paul ;Sahino??lu, Mehmet 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

Random walk search procedures for reliab

Random walk search procedures for reliability optimization of systems with fault tolerance

✍ Talal M. Alkhamis 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Comparison of some random search procedu

Comparison of some random search procedures for a global extremum

✍ S.M. Ermakov; A.A. Zhigyavskii; M.V. Kondratovich 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 497 KB

Random search as a means for queueing ne

Random search as a means for queueing network optimization

✍ Z. I. Flikop 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 344 KB

An Optimal Stopping Rule for the v-Metho

An Optimal Stopping Rule for the v-Method for Solving Ill-Posed Problems, Using Christoffel Functions

✍ M. Hanke; H.W. Engl 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 639 KB

We design an order-optimal stopping rule for the \(\nu\)-method for solving ill-posed problems with noisy data. The construction of the \(\nu\)-method is based on a sequence of Jacobi polynomials, and the stopping rule is based on a sequence of related Christoffel functions. The motivation for our s