Multilevel Optimization Methods: Convergence and Problem Structure
Chin Pang Ho(c.ho12imperial.ac.uk)
Abstract: Building upon multigrid methods, the framework of multilevel optimization methods was developed to solve structured optimization problems, including problems in optimal control, image processing, etc. In this paper, we give a broader view of the multilevel framework and establish some connections between multilevel algorithms and the other approaches. An interesting case of the so called Galerkin model is further studied. By studying three different case studies of the Galerkin model, we take the first step to show how the structure of optimization problems could improve the convergence of multilevel algorithms.
Keywords: Convex optimization; Multilevel algorithms.
Category 1: Convex and Nonsmooth Optimization (Convex Optimization )
Category 2: Nonlinear Optimization (Unconstrained Optimization )
Entry Submitted: 11/01/2016
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|