A proximal-based algorithm for piecewise sparse approximation with application to scattered data fitting
From MaRDI portal
Publication:2689063
Cites work
- scientific article; zbMATH DE number 1404604 (Why is no real title available?)
- scientific article; zbMATH DE number 2229941 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- A unified primal-dual algorithm framework based on Bregman iteration
- Applications of rough sets in big data analysis: an overview
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Convex Analysis
- Frequency response based curve fitting approximation of fractional-order PID controllers
- Image decomposition via the combination of sparse representations and a variational approach
- Modified PHT-splines
- Multilevel regularization of wavelet based fitting of scattered data -- some experiments
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Piecewise sparse recovery in union of bases
- Piecewise sparse recovery via piecewise inverse scale space algorithm with deletion rule
- Scattered data reconstruction by regularization in B-spline and associated wavelet spaces
- Sharp recovery bounds for convex demixing, with applications
- Sparse approximate solution of fitting surface to scattered points by MLASSO model
- THB-splines: The truncated basis for hierarchical splines
This page was built for publication: A proximal-based algorithm for piecewise sparse approximation with application to scattered data fitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689063)