Newton-type Multilevel Optimization Method
Abstract
Inspired by multigrid methods for linear systems of equations, multilevel optimization methods have been proposed to solve structured optimization problems. Multilevel methods make more assumptions regarding the structure of the optimization model, and as a result, they outperform single-level methods, especially for large-scale models. The impressive performance of multilevel optimization methods is an empirical observation, and no theoretical explanation has so far been proposed. In order to address this issue, we study the convergence properties of a multilevel method that is motivated by second-order methods. We take the first step toward establishing how the structure of an optimization problem is related to the convergence rate of multilevel algorithms.
Cite
@article{arxiv.1911.11366,
title = {Newton-type Multilevel Optimization Method},
author = {Chin Pang Ho and Michal Kocvara and Panos Parpas},
journal= {arXiv preprint arXiv:1911.11366},
year = {2019}
}