Idioma:

Coordinate descent algorithms

Wright, Stephen J.

Mathematical programming, 2015-06, Vol.151 (1), p.3-34 [Periódico revisado por pares]

Berlin/Heidelberg: Springer Berlin Heidelberg

Texto completo disponível

Citações Citado por

Enviar para

Título:
Coordinate descent algorithms
Autor: Wright, Stephen J.
Assuntos: Algorithms ; Calculus of Variations and Optimal Control; Optimization ; Combinatorics ; Full Length Paper ; Linear equations ; Machine learning ; Mathematical and Computational Physics ; Mathematical Methods in Physics ; Mathematics ; Mathematics and Statistics ; Mathematics of Computing ; Numerical Analysis ; Optimization ; Optimization algorithms ; Studies ; Theoretical
É parte de: Mathematical programming, 2015-06, Vol.151 (1), p.3-34
Descrição: Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes. They have been used in applications for many years, and their popularity continues to grow because of their usefulness in data analysis, machine learning, and other areas of current interest. This paper describes the fundamentals of the coordinate descent approach, together with variants and extensions and their convergence properties, mostly with reference to convex objectives. We pay particular attention to a certain problem structure that arises frequently in machine learning applications, showing that efficient implementations of accelerated coordinate descent algorithms are possible for problems of this type. We also present some parallel variants and discuss their convergence properties under several models of parallel execution.
Editor: Berlin/Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 2 Avançar Ir para próxima página

Realização: Logos de Redes Sociais:

Coordinate descent algorithms

Wright, Stephen J.

Berlin/Heidelberg: Springer Berlin Heidelberg

Buscando em bases de dados remotas. Favor aguardar.