A local MM subspace method for solving constrained variational problems in image recovery
From MaRDI portal
Publication:6162148
DOI10.1007/s10851-022-01112-zzbMath1522.65102MaRDI QIDQ6162148
Ségolène Martin, Emilie Chouzenoux, Jean-Christophe Pesquet
Publication date: 15 June 2023
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
constrained optimizationmajorization-minimizationsmooth optimizationexterior penalty methodsubspace accelerationPET reconstructionwavelet restoration
Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fast projection onto the simplex and the \(l_1\) ball
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- An interior-point trust-funnel algorithm for nonlinear optimization
- Sequential subspace optimization for nonlinear inverse problems
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- Nonlinear programming without a penalty function or a filter
- On the limited memory BFGS method for large scale optimization
- A fast subspace method for image deblurring
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Clipped noisy images: heteroskedastic modeling and practical denoising
- Weakly constrained minimization: application to the estimation of images and signals involving constant regions
- An approximate penalty method with descent for convex optimization problems
- A subspace SQP method for equality constrained optimization
- A modified spectral conjugate gradient projection algorithm for total variation image restoration
- Recent advances in trust region algorithms
- Global convergence of a modified gradient projection method for convex constrained problems
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- A nonsmooth Morse--Sard theorem for subanalytic functions
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Memory gradient method for the minimization of functions
- Study on a supermemory gradient method for the minimization of functions
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- Proximal Splitting Methods in Signal Processing
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- A scaled gradient projection method for constrained image deblurring
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Conjugate gradient methods for linearly constrained nonlinear programming
- Large-scale linearly constrained optimization
- On the Convergence of the Lagged Diffusivity Fixed Point Method in Total Variation Image Restoration
- Numerical Stability and Efficiency of Penalty Algorithms
- Topology preserving deformable image matching using constrained hierarchical parametric models
- Trust Region Methods
- Camera Model Identification Based on the Heteroscedastic Noise Model
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- Exact Penalty Functions in Constrained Optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- SPOQ $\ell _p$-Over-$\ell _q$ Regularization for Sparse Signal Recovery Applied to Mass Spectrometry
- Function minimization by conjugate gradients
- A Proximal Iteration for Deconvolving Poisson Noisy Images Using Sparse Representations
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration
- Epigraphical Projection for Solving Least Squares Anscombe Transformed Constrained Optimization Problems
- Greedy Sparsity-Constrained Optimization
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- THE TRANSFORMATION OF POISSON, BINOMIAL AND NEGATIVE-BINOMIAL DATA
- Convex analysis and monotone operator theory in Hilbert spaces
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A trust region method based on interior point techniques for nonlinear programming.
- Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients
