Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
From MaRDI portal
Publication:3544265
DOI10.1137/060669498zbMath1167.90011OpenAlexW1967020502MaRDI QIDQ3544265
Patrick L. Combettes, Jean-Christophe Pesquet
Publication date: 5 December 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060669498
strong convergencesignal recoveryHilbert spaceconvex programmingforward-backward splitting algorithmproximal thresholding
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (53)
Proximal Splitting Methods in Signal Processing ⋮ On the convergence of an active-set method for ℓ1minimization ⋮ On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations ⋮ Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere ⋮ Non-convex sparse regularisation ⋮ Monotone operator theory in convex optimization ⋮ Moreau's decomposition in Banach spaces ⋮ Minimization of equilibrium problems, variational inequality problems and fixed point problems ⋮ Perspective functions: proximal calculus and applications in high-dimensional statistics ⋮ Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems ⋮ On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ Proximal algorithms for multicomponent image recovery problems ⋮ Dualization of signal recovery problems ⋮ Sparse identification of posynomial models ⋮ Sparse broadband beamformer design via proximal optimization Techniques ⋮ A nonconvex approach to low-rank matrix completion using convex optimization ⋮ Regularized learning schemes in feature Banach spaces ⋮ Extension of forward-reflected-backward method to non-convex mixed variational inequalities ⋮ Thresholding gradient methods in Hilbert spaces: support identification and linear convergence ⋮ Deep neural network structures solving variational inequalities ⋮ A separable surrogate function method for sparse and low-rank matrices decomposition ⋮ Sparsity-Assisted Signal Smoothing ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ A characterization of proximity operators ⋮ Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function ⋮ On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions ⋮ Convolutional proximal neural networks and plug-and-play algorithms ⋮ A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems ⋮ Consistent learning by composite proximal thresholding ⋮ Incremental projection approach of regularization for inverse problems ⋮ Conversion of algorithms by releasing projection for minimization problems ⋮ Regression analysis of locality preserving projections via sparse penalty ⋮ Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization ⋮ A general composite algorithm for solving general equilibrium problems and fixed point problems in Hilbert spaces ⋮ Proximity for sums of composite functions ⋮ IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems ⋮ Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization ⋮ Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors ⋮ Linearized Bregman iterations for compressed sensing ⋮ Convergence of the linearized Bregman iteration for ℓ₁-norm minimization ⋮ Perspective maximum likelihood-type estimation via proximal decomposition ⋮ Reconstruction of functions from prescribed proximal points ⋮ A parameterized proximal point algorithm for separable convex optimization ⋮ Solving mixed variational inequalities beyond convexity ⋮ A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems ⋮ Synthesis of recurrent neural dynamics for monotone inclusion with application to Bayesian inference ⋮ Convergence of proximal gradient algorithm in the presence of adjoint mismatch * ⋮ A splitting algorithm for coupled system of primal-dual monotone inclusions ⋮ An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence ⋮ Proximal operator of quotient functions with application to a feasibility problem in query optimization ⋮ Proximal Gradient Methods with Adaptive Subspace Sampling ⋮ Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators ⋮ Proximal Gradient Methods for Machine Learning and Imaging
This page was built for publication: Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
