On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.

We estimate the worst-case complexity of minimizing an unconstrained, nonconvex composite objective with a structured nonsmooth term by means of some first-order methods. We find that it is unaffected by the nonsmoothness of the objective in that a first-order trust-region or quadratic regularizatio...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak: Cartis, C, Gould, N, Toint, P
Formatua: Journal article
Hizkuntza:English
Argitaratua: 2011

Antzeko izenburuak