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

凸优化中的贪婪展开

Greedy expansions in convex optimization

V. N. Temlyakov

摘要:

本文是前一作者关于凸优化的论文的后续。在那篇论文中,我们开始了从非线性近似中调整贪婪型算法来寻找凸优化问题的稀疏解的过程。本文对Banach空间中非线性逼近中最流行的三种贪婪算法-弱Chebyshev贪婪算法、带自由松弛的弱贪婪算法和弱松弛贪婪算法进行了改进,使之适用于求解凸优化问题。我们继续研究凸优化问题的稀疏近似解。众所周知,在许多工程应用中,研究人员感兴趣的是将优化问题的近似解作为来自给定元素系统的元素的线性组合。有越来越多的兴趣在建设这样的稀疏近似解决方案,使用不同的贪婪型算法。在本文中,我们专注于贪婪算法,提供的扩展,这意味着在$m$次迭代的近似等于从以前的迭代($(m-1)$ th迭代)和一个元素的近似从字典与适当的系数的总和。Banach空间元素的贪婪展开问题在非线性逼近理论中得到了很好的研究。乍一看,给定元素的扩展问题的设置和优化问题中的扩展问题的设置是非常不同的。然而,事实证明,同样的技术可以用来解决这两个问题。我们展示了如何在非线性逼近理论,特别是贪婪的扩展技术,可以调整为找到一个稀疏的解决方案的优化问题的扩展相对于一个给定的字典。

英文摘要:

This paper is a follow up to the previous author's paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there three the most popular in nonlinear approximation in Banach spaces greedy algorithms -- Weak Chebyshev Greedy Algorithm, Weak Greedy Algorithm with Free Relaxation and Weak Relaxed Greedy Algorithm -- for solving convex optimization problems. We continue to 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. In this paper we concentrate on greedy algorithms that provide expansions, which means that the approximant at the $m$th iteration is equal to the sum of the approximant from the previous iteration ($(m-1)$th iteration) and one element from the dictionary with an appropriate coefficient. The problem of greedy expansions of elements of a Banach space is well studied in nonlinear approximation theory. At a first glance the setting of a problem of expansion of a given element and the setting of the problem of expansion in an optimization problem are very different. However, 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 expansions technique can be adjusted for finding a sparse solution of an optimization problem given by an expansion with respect to a given dictionary.

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

↑