Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
DOI10.1137/060669498zbMATH Open1167.90011OpenAlexW1967020502MaRDI QIDQ3544265FDOQ3544265
Authors: 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
Recommendations
- Signal Recovery by Proximal Forward-Backward Splitting
- Iterative thresholding algorithms
- Proximal splitting methods in signal processing
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
Hilbert spaceconvex programmingstrong convergenceforward-backward splitting algorithmsignal recoveryproximal thresholding
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cited In (55)
- A characterization of proximity operators
- Proximal algorithms for multicomponent image recovery problems
- Sparse identification of posynomial models
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- A general composite algorithm for solving general equilibrium problems and fixed point problems in Hilbert spaces
- Proximal Gradient Methods with Adaptive Subspace Sampling
- Non-convex sparse regularisation
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations
- Solving mixed variational inequalities beyond convexity
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- Proximal operator of quotient functions with application to a feasibility problem in query optimization
- A parameterized proximal point algorithm for separable convex optimization
- Proximal Gradient Methods for Machine Learning and Imaging
- Proximal splitting methods in signal processing
- On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- On the convergence of an active-set method for ℓ1minimization
- Deep neural network structures solving variational inequalities
- Conversion of algorithms by releasing projection for minimization problems
- Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems
- Reconstruction of functions from prescribed proximal points
- Incremental projection approach of regularization for inverse problems
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere
- A splitting algorithm for coupled system of primal-dual monotone inclusions
- Convolutional proximal neural networks and plug-and-play algorithms
- Regression analysis of locality preserving projections via sparse penalty
- Linearized Bregman iterations for compressed sensing
- Perspective maximum likelihood-type estimation via proximal decomposition
- Synthesis of recurrent neural dynamics for monotone inclusion with application to Bayesian inference
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
- Moreau's decomposition in Banach spaces
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems
- Dualization of signal recovery problems
- Regularized learning schemes in feature Banach spaces
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators
- Proximity for sums of composite functions
- An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- Monotone operator theory in convex optimization
- Sparsity-Assisted Signal Smoothing
- Sparse broadband beamformer design via proximal optimization Techniques
- Signal Recovery by Proximal Forward-Backward Splitting
- A nonconvex approach to low-rank matrix completion using convex optimization
- Convergence of proximal gradient algorithm in the presence of adjoint mismatch *
- Consistent learning by composite proximal thresholding
- A separable surrogate function method for sparse and low-rank matrices decomposition
- Proximal point type algorithms with relaxed and inertial effects beyond convexity
- Extension of forward-reflected-backward method to non-convex mixed variational inequalities
This page was built for publication: Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544265)