Pages that link to "Item:Q3544265"
From MaRDI portal
The following pages link to Proximal Thresholding Algorithm for Minimization over Orthonormal Bases (Q3544265):
Displayed 35 items.
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- Moreau's decomposition in Banach spaces (Q353156) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- Incremental projection approach of regularization for inverse problems (Q517924) (← links)
- Regression analysis of locality preserving projections via sparse penalty (Q528758) (← links)
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
- A general composite algorithm for solving general equilibrium problems and fixed point problems in Hilbert spaces (Q536004) (← links)
- Proximity for sums of composite functions (Q536271) (← links)
- Minimization of equilibrium problems, variational inequality problems and fixed point problems (Q604954) (← links)
- Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems (Q610880) (← links)
- Dualization of signal recovery problems (Q618873) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
- Consistent learning by composite proximal thresholding (Q681492) (← links)
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors (Q713906) (← links)
- Non-convex sparse regularisation (Q847742) (← links)
- Sparse identification of posynomial models (Q894327) (← links)
- Monotone operator theory in convex optimization (Q1650774) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- Proximal algorithms for multicomponent image recovery problems (Q1932869) (← links)
- Conversion of algorithms by releasing projection for minimization problems (Q2249105) (← links)
- A splitting algorithm for coupled system of primal-dual monotone inclusions (Q2342140) (← links)
- Proximal operator of quotient functions with application to a feasibility problem in query optimization (Q2345665) (← links)
- Perspective functions: proximal calculus and applications in high-dimensional statistics (Q2408636) (← links)
- An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence (Q2866116) (← links)
- Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
- On the convergence of an active-set method for ℓ<sub>1</sub>minimization (Q2905351) (← links)
- A nonconvex approach to low-rank matrix completion using convex optimization (Q2955982) (← links)
- Linearized Bregman iterations for compressed sensing (Q3055156) (← links)
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization (Q3055191) (← links)
- On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations (Q3454491) (← links)
- Regularized learning schemes in feature Banach spaces (Q4594821) (← links)
- Sparsity-Assisted Signal Smoothing (Q5358729) (← links)
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems (Q5737721) (← links)
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization (Q5746695) (← links)