arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.0334stat.MLmath.OC
收藏

Banach空间上的凸优化

Convex optimization on Banach Spaces

R. A. DeVore, V. N. Temlyakov

摘要:

将只使用函数求值的贪婪算法应用于一般Banach空间$X$中的凸优化问题。随着算法,使用精确的评估,近似评估的算法进行治疗。给出了算法收敛速度的先验上界。这些界限取决于平滑的目标函数和稀疏性或压缩性(相对于一个给定的字典)的一个点在$X$,其中达到最小值。

英文摘要:

Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper bounds for the convergence rate of the proposed algorithms are given. These bounds depend on the smoothness of the objective function and the sparsity or compressibility (with respect to a given dictionary) of a point in $X$ where the minimum is attained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑