返回
CYCLIC COORDINATE-UPDATE ALGORITHMS FOR FIXED-POINT PROBLEMS: ANALYSIS AND APPLICATIONS
DOI:10.1137/16M1102653.png)
摘要
En 中文
Many problems reduce to the fixed-point problem of solving x = T(x), where T is a mapping from a Hilbert space to itself. To this problem we apply the coordinate-update algorithms, which update only one or a few components of x at each step. When each step is cheap, these algorithms are faster than the full fixed-point iteration (which updates all the components). In this paper, we focus on cyclic coordinate selection rules, where the ordering of coordinates in each cycle is arbitrary. The corresponding algorithms are fast, but their convergence is unknown in the fixed-point setting. When T is a nonexpansive operator and has a fixed point, we show that the sequence of coordinate-update iterates converges to a fixed point under proper step sizes. This result applies to the primal-dual coordinate-update algorithms, which have wide applications to optimization problems with nonseparable nonsmooth objectives, and/or global linear constraints. Numerically, we apply coordinate-update algorithms with cyclic, shuffled cyclic, and random selection rules to l(1)-robust least squares, total variation minimization, and nonnegative matrix factorization. These algorithms converge much faster than the standard fixed-point iteration. Among the three rules, cyclic and shuffled cyclic rules are overall faster than the random rule.
Keyword:
coordinate update
cyclic
shuffled cyclic
fixed point
nonexpansive operator
robust least squares
image reconstruction
nonnegative matrix factorization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Small Silencing RNAs in Plants Are Mobile and Direct Epigenetic Modification in Recipient Cells
Science
IF0
Effects of Crack Size Distribution and Specimen Length on the Correlation between <i>n</i>-Value and Critical Current in Heterogeneously Cracked Superconducting Tape裂纹尺寸分布和试样长度对异质裂纹超导带材中n值与临界电流相关性的影响

