MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization

DOI10.1137/23M1552140zbMATH Open1545.65237MaRDI QIDQ6587341FDOQ6587341

Authors: Andersen Man Shun Ang, H. De Sterck, Stephen A. Vavasis 

Publication date: 14 August 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3954181
• scientific article; zbMATH DE number 7404502
• Truncated nonsmooth Newton multigrid methods for convex minimization problems
• A first-order multigrid method for bound-constrained convex optimization
• Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces

zbMATH Keywords

convex optimizationobstacle problemsubdifferentialmultigridrestrictionproximal gradient

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
• Numerical Optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Adaptive restart for accelerated gradient schemes
• Title not available (Why is that?)
• First-order methods in optimization
• Title not available (Why is that?)
• Convex Analysis
• Signal Recovery by Proximal Forward-Backward Splitting
• Title not available (Why is that?)
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
• A generalized proximal point algorithm for certain non-convex minimization problems
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• On multi-grid methods for variational inequalities
• Monotone multigrid methods for elliptic variational inequalities. I
• Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• A multigrid approach to discretized optimization problems
• A Multigrid Tutorial, Second Edition
• Iterative Methods for Total Variation Denoising
• A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
• Truncated nonsmooth Newton multigrid methods for convex minimization problems
• Adaptive Multilevel Methods for Obstacle Problems
• Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
• Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
• A relaxation method for solving elliptic difference equations
• Convergence of Multi-Grid Iterations Applied to Difference Equations
• A multilevel approach for nonnegative matrix factorization
• Title not available (Why is that?)
• An \(L^1\) penalty method for general obstacle problems
• Linear convergence of first order methods for non-strongly convex optimization
• Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
• A multilevel iterative method for symmetric, positive definite linear complementarity problems
• Numerical solution of the obstacle problem by the penalty method
• Moreau-Rockafellar type theorem for convex set functions
• A first-order multigrid method for bound-constrained convex optimization
• A multilevel proximal gradient algorithm for a class of composite optimization problems
• Title not available (Why is that?)
• A Multilevel Iterated-Shrinkage Approach to $l_{1}$ Penalized Least-Squares Minimization

This page was built for publication: MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587341)