Results 21 to 30 of about 27,887 (259)
Interpolating greedy and reluctant algorithms [PDF]
Optimization Methods and Software, 2005 9 pages.
Pierluigi Contucci +4 more
openaire +5 more sources
On performance of greedy algorithms
Journal of Approximation Theory, 2011 Let \(H\) be a Hilbert space and \(\mathcal{D}:=\{\varphi_{i}:i\in\mathbb{N} \}\subset H\) be such that \(\overline{\text{span}\mathcal{D}}\mathcal{=}H.\) A dictionary \(\mathcal{D}\) is called \(M\)-coherent if its coherence, defined by \(\sup\{|| :\varphi,\psi\in\mathcal{D}, \varphi\neq\psi\}\) is exactly \(M.\) The authors consider the Orthogonal ...
Vladimir N. Temlyakov, Pavel Zheltov
openaire +1 more source
Super greedy type algorithms [PDF]
Advances in Computational Mathematics, 2011 We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The idea of picking several elements at a greedy step of the algorithm is not new.
Entao Liu, Vladimir N. Temlyakov
openaire +3 more sources
On the convergence of the order-preserving weak greedy algorithm for subspaces generated by the Szego kernel in the Hardy space [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 In this article we consider representing properties of subspaces generated by the Szego kernel. We examine under which conditions on the sequence of points of the unit disk the order-preserving weak greedy algorithm for appropriate subspaces generated by
Speransky, Konstantin Sergeevich
doaj +1 more source
Dictionary Preconditioning for Greedy Algorithms [PDF]
IEEE Transactions on Signal Processing, 2008 This paper introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (orthogonal) matching pursuit which improves their performance in finding sparse signal representations in redundant dictionaries while maintaining the same complexity.
Karin Schnass, Pierre Vandergheynst
openaire +2 more sources
Journal of Information Systems Engineering and Business Intelligence, 2015 Abstrak— Pencarian hotel merupakan hal yang penting dilakukan wisatawan dalam melakukan perjalanan wisata. Wisatawan akan mempertimbangkan kriteria hotel seperti kelas, harga dan review hotel.
Audrey Maximillian Herli +2 more
doaj +3 more sources
Journal of Complexity, 2003 A dictionary is a subset \(\mathcal D\) of a Hilbert space \((H,\langle\cdot,\cdot\rangle)\) such that \(\|g\|=1\) for all \(g\in \mathcal D\) and cl-span\((\mathcal D)=H.\) The objective of greedy algorithms is to construct a sequence \(\{g_k\}\) in \(\mathcal D\) and a sequence of approximants \(G_k\in\mathcal D_k=\) span\(\{g_1,\dots,g_k\}\) such ...
Adam Lutoborski, Vladimir N. Temlyakov
openaire +3 more sources
On the greedy algorithm for satisfiability
Information Processing Letters, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koutsoupias, E, Papadimitriou, C
openaire +4 more sources
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Rémi Gribonval, Morten Nielsen 0002
openaire +4 more sources
Semisoft Generalized Total Variation Minimization for Image Reconstruction in Computed Tomography
IEEE Access, 2017 The generalized l1 greedy algorithm was recently proposed and shown to outperform the standard reweighted l1-minimization and l1-greedy algorithms for image reconstruction in computed tomography (CT).
Xiezhang Li +3 more
doaj +1 more source