MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
type: Item
instance of: scholarly article
title: MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
zbMATH Open document ID: 1545.65237
author: Andersen Man Shun Ang
author: H. De Sterck
author: Stephen A. Vavasis
published in: SIAM Journal on Optimization
publication date: 2024-08-14T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7896743
zbMATH Keywords: multigrid
zbMATH Keywords: restriction
zbMATH Keywords: proximal gradient
zbMATH Keywords: subdifferential
zbMATH Keywords: convex optimization
zbMATH Keywords: obstacle problem
MaRDI profile type: Publication
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: First-Order Methods in Optimization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Multi-Level Adaptive Solutions to Boundary-Value Problems
cites work: Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
cites work: A Multigrid Tutorial, Second Edition
cites work: Q4251280
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: A relaxation method for solving elliptic difference equations
cites work: A generalized proximal point algorithm for certain non-convex minimization problems
cites work: A multilevel approach for nonnegative matrix factorization
cites work: Truncated Nonsmooth Newton Multigrid Methods for Convex Minimization Problems
cites work: Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
cites work: Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
cites work: Convergence of Multi-Grid Iterations Applied to Difference Equations
cites work: Q3727300
cites work: On multi-grid methods for variational inequalities
cites work: Adaptive Multilevel Methods for Obstacle Problems
cites work: IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
cites work: A first-order multigrid method for bound-constrained convex optimization
cites work: Monotone multigrid methods for elliptic variational inequalities. I
cites work: Moreau-Rockafellar type theorem for convex set functions
cites work: Q4672206
cites work: A multilevel iterative method for symmetric, positive definite linear complementarity problems
cites work: Q5728711
cites work: A multigrid approach to discretized optimization problems
cites work: Linear convergence of first order methods for non-strongly convex optimization
cites work: Numerical Optimization
cites work: Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
cites work: Adaptive restart for accelerated gradient schemes
cites work: A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems
cites work: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
cites work: Convex Analysis
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q3745373
cites work: Numerical solution of the obstacle problem by the penalty method
cites work: Q5187067
cites work: An $L^1$ Penalty Method for General Obstacle Problems
cites work: A Multilevel Iterated-Shrinkage Approach to $l_{1}$ Penalized Least-Squares Minimization
cites work: Iterative Methods for Total Variation Denoising
cites work: A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
DOI: 10.1137/23M1552140
description: scientific article; zbMATH DE number 7896743