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

凸优化中的贪婪逼近

Greedy approximation in convex optimization

V. N. Temlyakov

摘要:

我们研究凸优化问题的稀疏近似解。众所周知,在许多工程应用中,研究人员感兴趣的是将优化问题的近似解作为来自给定元素系统的元素的线性组合。有越来越多的兴趣在建设这样的稀疏近似解决方案,使用不同的贪婪型算法。在非线性逼近理论中,由给定系统(字典)中元素的线性组合逼近Banach空间中给定元素的问题得到了很好的研究。乍一看,近似和优化问题的设置非常不同。在近似问题中,给定一个元素,我们的任务是找到它的稀疏近似;在优化理论中,给定一个能量函数,我们应该找到最小化问题的近似稀疏解。事实证明,同样的技术可以用来解决这两个问题。我们将展示如何在非线性逼近理论的技术,特别是贪婪的近似技术,可以调整找到一个稀疏的解决方案的优化问题。

英文摘要:

We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using different greedy-type algorithms. The problem of approximation of a given element of a Banach space by linear combinations of elements from a given system (dictionary) is well studied in nonlinear approximation theory. At a first glance the settings of approximation and optimization problems are very different. In the approximation problem an element is given and our task is to find a sparse approximation of it. In optimization theory an energy function is given and we should find an approximate sparse solution to the minimization problem. It turns out that the same technique can be used for solving both problems. We show how the technique developed in nonlinear approximation theory, in particular, the greedy approximation technique can be adjusted for finding a sparse solution of an optimization problem.

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

↑