MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
From MaRDI portal
Publication:6587341
DOI10.1137/23m1552140zbMATH Open1545.65237MaRDI QIDQ6587341
Hans De Sterck, Andersen Man Shun Ang, Stephen A. Vavasis
Publication date: 14 August 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Numerical solution of the obstacle problem by the penalty method
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- Moreau-Rockafellar type theorem for convex set functions
- 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
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Adaptive restart for accelerated gradient schemes
- Linear convergence of first order methods for non-strongly convex optimization
- A multilevel approach for nonnegative matrix factorization
- A first-order multigrid method for bound-constrained convex optimization
- Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
- Truncated Nonsmooth Newton Multigrid Methods for Convex Minimization Problems
- Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
- A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Convergence of Multi-Grid Iterations Applied to Difference Equations
- A generalized proximal point algorithm for certain non-convex minimization problems
- Monotone Operators and the Proximal Point Algorithm
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Numerical Optimization
- Adaptive Multilevel Methods for Obstacle Problems
- A Multigrid Tutorial, Second Edition
- A multigrid approach to discretized optimization problems
- A Multilevel Iterated-Shrinkage Approach to $l_{1}$ Penalized Least-Squares Minimization
- First-Order Methods in Optimization
- Iterative Methods for Total Variation Denoising
- Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
- An $L^1$ Penalty Method for General Obstacle Problems
- A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems
- Signal Recovery by Proximal Forward-Backward Splitting
- A relaxation method for solving elliptic difference equations
- Convex Analysis
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization