arXiv Open Access 2014

Convergence and rate of convergence of some greedy algorithms in convex optimization

Vladimir Temlyakov

Lihat Sumber

Abstrak

The paper gives a systematic study of the approximate versions of three greedy-type algorithms that are widely used in convex optimization. By approximate version we mean the one where some of evaluations are made with an error. Importance of such versions of greedy-type algorithms in convex optimization and in approximation theory was emphasized in previous literature.

Topik & Kata Kunci

stat.ML math.NA

Penulis (1)

Vladimir Temlyakov

Format Sitasi

APA MLA BibTeX

Temlyakov, V. (2014). Convergence and rate of convergence of some greedy algorithms in convex optimization. https://arxiv.org/abs/1412.3297

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2014
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓