Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
From MaRDI portal
Publication:530079
DOI10.1007/S00211-016-0842-XzbMATH Open1368.65087OpenAlexW2531491639MaRDI QIDQ530079FDOQ530079
Authors: Serena Morigi, Ivan W. Selesnick, Alessandro Lanza, Fiorella Sgallari 
Publication date: 9 June 2017
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-016-0842-x
Recommendations
- Non-convex optimization via strongly convex majorization-minimization
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- Composite optimization by nonconvex majorization-minimization
- Linearly constrained nonsmooth and nonconvex minimization
- Nonconvex approximations in unconstrained minimization
- A new method for nonsmooth convex optimization
- On nonconvex optimization
- scientific article; zbMATH DE number 125295
- scientific article; zbMATH DE number 3843083
- Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
alternating direction method of multipliersalgorithmnumerical experimentnonconvex nonsmooth optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Nonlinear total variation based noise removal algorithms
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Convex analysis and monotone operator theory in Hilbert spaces
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A majorize-minimize subspace approach for \(\ell_2-\ell_0\) image regularization
- The Split Bregman Method for L1-Regularized Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Compressed sensing
- Proximal splitting methods in signal processing
- An EM algorithm for wavelet-based image restoration
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Iteratively reweighted least squares minimization for sparse recovery
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Convex image denoising via non-convex regularization with parameter selection
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- A brief survey of modern optimization for statisticians
- Efficient Minimization Method for a Generalized Total Variation Functional
- Constrained TV\(_p\)-\(\ell_2\) model for image restoration
- A generalized Krylov subspace method for \(\ell_p\)-\(\ell_q\) minimization
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- Energy minimization methods
- Title not available (Why is that?)
Cited In (23)
- Block Bregman majorization minimization with extrapolation
- Non-convex optimization via strongly convex majorization-minimization
- Majorization-minimization algorithms for nonsmoothly penalized objective functions
- ADMM-based residual whiteness principle for automatic parameter selection in single image super-resolution problems
- Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- A coupled non-convex hybrid regularization and weak \(H^{-1}\) image decomposition model for denoising application
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- Convex non-convex segmentation of scalar fields over arbitrary triangulated surfaces
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Iteratively reweighted FGMRES and FLSQR for sparse reconstruction
- Composite optimization by nonconvex majorization-minimization
- Convex non-convex variational models
- Flexible Krylov methods for \(\ell_p\) regularization
- Matrix completion for matrices with low-rank displacement
- Convex non-convex image segmentation
- A variational approach to additive image decomposition into structure, harmonic, and oscillatory components
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
- MOCCA: mirrored convex/concave optimization for nonconvex composite functions
- A convex-nonconvex variational method for the additive decomposition of functions on surfaces
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
- Non-convex total variation regularization for convex denoising of signals
Uses Software
This page was built for publication: Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530079)
