A multilevel algorithm for solving the trust-region subproblem
Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART II
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
SIAM Journal on Optimization
The Lifted Newton Method and Its Application in Optimization
SIAM Journal on Optimization
A Multilevel Algorithm for Simultaneously Denoising and Deblurring Images
SIAM Journal on Scientific Computing
Approximating Hessians in unconstrained optimization arising from discretized problems
Computational Optimization and Applications
Complexity bounds for second-order optimality in unconstrained optimization
Journal of Complexity
Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
SIAM Journal on Optimization
Line Search Multilevel Optimization as Computational Methods for Dense Optical Flow
SIAM Journal on Imaging Sciences
Computational Optimization and Applications
SIAM Journal on Optimization
SIAM Journal on Optimization
Hi-index | 0.00 |
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by partial differential equations. The algorithms in this class make use of the discretization level as a means of speeding up the computation of the step. This use is recursive, leading to true multilevel/multiscale optimization methods reminiscent of multigrid methods in linear algebra and the solution of partial differential equations. A simple algorithm of the class is then described and its numerical performance is shown to be numerically promising. This observation then motivates a proof of global convergence to first-order stationary points on the fine grid that is valid for all algorithms in the class.