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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 178; no. 1-2; pp. 301 - 326
Main Authors:	Banert, Sebastian, Boț, Radu Ioan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2019 Springer Nature B.V
Subjects:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Convergence analysis d.c. programming Direct current Full Length Paper Image processing Kurdyka-Lojasiewicz property Linear operators Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Operators (mathematics) Optimization Proximal-gradient algorithm Theoretical Toland dual Toland dual 65K05 Kurdyka–Łojasiewicz property 49M29 90C26 d.c. programming Proximal-gradient algorithm Convergence analysis
ISSN:	0025-5610, 1436-4646, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!