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.
Recommendations
- Assessing the performance of an optimization-based multilevel method
- Properties of a class of multilevel optimization algorithms for equality-constrained problems
- On high-order multilevel optimization strategies
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- A multigrid approach to discretized optimization problems
Cites work
- A first-order multigrid method for bound-constrained convex optimization
- A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
- A multigrid approach to discretized optimization problems
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- A Multigrid Tutorial, Second Edition
- A multilevel proximal gradient algorithm for a class of composite optimization problems
- A new multigrid finite element method for the transmission eigenvalue problems
- Computational science and engineering.
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- scientific article; zbMATH DE number 53856 (Why is no real title available?)
- scientific article; zbMATH DE number 736328 (Why is no real title available?)
- scientific article; zbMATH DE number 1078258 (Why is no real title available?)
- scientific article; zbMATH DE number 1561761 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations
- Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
- On high-order multilevel optimization strategies
- On the convergence of block coordinate descent type methods
- Properties of a class of multilevel optimization algorithms for equality-constrained problems
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Singularly perturbed Markov decision processes: a multiresolution algorithm
- Using inexact gradients in a multilevel optimization algorithm
Cited in
(6)- Assessing the performance of an optimization-based multilevel method
- A special newton-type optimization method
- Multihomogeneous Newton methods
- On high-order multilevel optimization strategies
- IML FISTA: a multilevel framework for inexact and inertial forward-backward. Application to image restoration
- Multilevel optimization: geometric coarse models and convergence analysis
This page was built for publication: Newton-type multilevel optimization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038170)
