Efficiency of minimizing compositions of convex functions and smooth maps

We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map. The basic algorithm we rely on is the prox-linear method, which in each iteration solves a regularized subproblem formed by linearizing the smooth...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 178; číslo 1-2; s. 503 - 558
Hlavní autori:	Drusvyatskiy, D., Paquette, C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2019 Springer Nature B.V
Predmet:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Composition Convexity Efficiency Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Secondary 90C06 Fast gradient methods Inexactness Gauss–Newton Complexity Prox-gradient Incremental methods Primary 97N60 90C30 Composite minimization Smoothing 90C25 Acceleration
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!