Cargando…

A general double-proximal gradient algorithm for d.c. programming

The possibilities of exploiting the special structure of d.c. programs, which consist of optimising the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave p...

Descripción completa

Detalles Bibliográficos
Autores principales: Banert, Sebastian, Boț, Radu Ioan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6830843/
https://www.ncbi.nlm.nih.gov/pubmed/31762494
http://dx.doi.org/10.1007/s10107-018-1292-2