✦ LIBER ✦

A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets

✍ Scribed by Perkins, Chris

Book ID: 118190242
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 177 KB
Volume: 40
Category: Article
ISSN: 0036-1429
DOI: 10.1137/s0036142900367557

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimation of the convergence rate of Dy

Estimation of the convergence rate of Dykstra’s cyclic projections algorithm in polyhedral case

✍ Xu Shusheng 📂 Article 📅 2000 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 162 KB

A convergence analysis for a convex vers

A convergence analysis for a convex version of Dikin's algorithm

✍ Jie Sun 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 729 KB

A linear programming algorithm for invar

A linear programming algorithm for invariant polyhedral sets of discrete-time linear systems

✍ A.A. ten Dam; J.W. Nieuwenhuis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Convergence analysis for a parallel Jaco

Convergence analysis for a parallel Jacobi algorithm

✍ M. El-Attar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Convergence analysis for a multiplicativ

Convergence analysis for a multiplicatively relaxed EM algorithm

✍ Alfredo N. Iusem 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 810 KB

## Abstract The expectation maximization (EM) algorithm is an iterative procedure used to determine maximum likelihood estimators in situations of incomplete data. In the case of independent Poisson variables it converges to a solution of a problem of the form min ∑[〈__a__^i^,__x__〉 − __b__~i~ log

Analysis of the Convergence Rate for the

Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets

✍ Borwein, Jonathan M.; Li, Guoyin; Yao, Liangjin 📂 Article 📅 2014 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 425 KB