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