A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems

We consider a class of nonconvex nonsmooth optimization problems whose objective is the sum of a smooth function and a finite number of nonnegative proper closed possibly nonsmooth functions (whose proximal mappings are easy to compute), some of which are further composed with linear maps. This kind...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 176; číslo 1-2; s. 339 - 367
Hlavní autoři:	Liu, Tianxiang, Pong, Ting Kei, Takeda, Akiko
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2019 Springer Nature B.V
Témata:	Algorithms Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Continuity (mathematics) Envelopes Full Length Paper Iterative methods Mapping Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Methods Numerical Analysis Optimization Structured matrices Theoretical Simultaneous structures 90C30 65K05 Moreau envelope Proximal mapping 90C26 Difference-of-convex approximation
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!