Proximal algorithms

Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in...

Descripción completa

Detalles Bibliográficos
Autores principales: Parikh, Neal, Boyd, Stephen
Lenguaje:eng
Publicado: Now Publishers 2014
Materias:
XX
Acceso en línea:http://cds.cern.ch/record/2762176
_version_ 1780970656618250240
author Parikh, Neal
Boyd, Stephen
author_facet Parikh, Neal
Boyd, Stephen
author_sort Parikh, Neal
collection CERN
description Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice.
id cern-2762176
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2014
publisher Now Publishers
record_format invenio
spelling cern-27621762021-04-21T16:39:14Zhttp://cds.cern.ch/record/2762176engParikh, NealBoyd, StephenProximal algorithmsXXProximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice.Now Publishersoai:cds.cern.ch:27621762014
spellingShingle XX
Parikh, Neal
Boyd, Stephen
Proximal algorithms
title Proximal algorithms
title_full Proximal algorithms
title_fullStr Proximal algorithms
title_full_unstemmed Proximal algorithms
title_short Proximal algorithms
title_sort proximal algorithms
topic XX
url http://cds.cern.ch/record/2762176
work_keys_str_mv AT parikhneal proximalalgorithms
AT boydstephen proximalalgorithms

Ejemplares similares