The multiproximal linearization method for convex composite problems

Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The resulting method, called the Multiprox method, consists in solvin...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 182; číslo 1-2; s. 1 - 36
Hlavní autoři:	Bolte, Jérôme, Chen, Zheng, Pauwels, Edouard
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2020 Springer Nature B.V Springer Verlag
Témata:	Algorithms Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Complexity Constraints Curvature Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Methods Numerical Analysis Operators (mathematics) Optimization Optimization and Control Theoretical 90C30 Convex optimization 90C25 90C47 Composite optimization First order methods Proximal Gauss–Newton’s method Prox-linear method Complexity
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!