- | ||||
|
![]()
|
Adaptive Cubic Regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
stefania Bellavia (stefania.bellavia Abstract: We consider the Adaptive Regularization with Cubics approach for solving nonconvex optimization problems and propose a new variant based on inexact Hessian information chosen dynamically. The theoretical analysis of the proposed procedure is given. The key property of ARC framework, constituted by optimal worst-case function/derivative evaluation bounds for first- and second-order critical point, is guaranteed. Application to largescale finite-sum minimization based on subsampled Hessian is discussed and analyzed in both a deterministic andmprobabilistic manner and equipped with numerical experiments on synthetic and real datasets. Keywords: Adaptive regularization with cubics; nonconvex optimization; worst-case analysis, finite-sum optimization. Category 1: Nonlinear Optimization (Unconstrained Optimization ) Citation: Download: [PDF] Entry Submitted: 08/19/2018 Modify/Update this entry | ||
Visitors | Authors | More about us | Links | |
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository
|
Submit Update Policies |
Coordinator's Board Classification Scheme Credits Give us feedback |
Optimization Journals, Sites, Societies | |
![]() |