✦ LIBER ✦

A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm

✍ Scribed by Canon, M. D.; Cullum, C. D.

Book ID: 118207759
Publisher: Society for Industrial and Applied Mathematics
Year: 1968
Weight: 576 KB
Volume: 6
Category: Article
ISSN: 0036-1402
DOI: 10.1137/0306032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Accelerating convergence of the Frank-Wo

Accelerating convergence of the Frank-Wolfe algorithm

✍ Andrés Weintraub; Carmen Ortiz; Jaime González 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 404 KB

A modified Frank-Wolfe algorithm and its

A modified Frank-Wolfe algorithm and its convergence properties

✍ Fang Wu; Shiquan Wu 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 329 KB

An upper bound on the speed of convergen

An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions (Corresp.)

✍ Boukris, P. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 234 KB

Tight Upper Bound on the Outage Probabil

Tight Upper Bound on the Outage Probability of QSTBC

✍ Sezgin, A.; Jorswieck, E.A. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 137 KB

A tight upper bound on the Bayesian prob

A tight upper bound on the Bayesian probability of error

✍ Hashlamoun, W.A.; Varshney, P.K.; Samarasooriya, V.N.S. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 518 KB

Techniques for bounding the convergence

Techniques for bounding the convergence rate of genetic algorithms

✍ Yuri Rabinovich; Avi Wigderson 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 2 views

The main purpose of the present paper is the study of computational aspects, ## Ž . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about