Sparse approximation of fitting surface by elastic net
DOI10.1007/S40314-017-0475-4zbMATH Open1453.65031OpenAlexW2735558853MaRDI QIDQ1993576FDOQ1993576
Authors: Yong-Xia Hao, Dianchen Lu 
Publication date: 5 November 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-017-0475-4
Recommendations
- Sparse approximate solution of fitting surface to scattered points by MLASSO model
- Scattered data fitting by minimal surface
- Sparse RBF surface representations
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery
- Elastic-net regularization in learning theory
Computational methods for sparse matrices (65F50) Numerical interpolation (65D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Error estimates for the regularization of least squares problems
- Error estimates for large-scale ill-posed problems
- Least angle regression. (With discussion)
- Regularization parameter determination for discrete ill-posed problems
- Title not available (Why is that?)
- ErresTools
- lbdtik
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- Decoding by Linear Programming
- Stable signal recovery from incomplete and inaccurate measurements
- The Split Bregman Method for L1-Regularized Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- De-noising by soft-thresholding
- Compressed sensing and best \(k\)-term approximation
- Split Bregman methods and frame based image restoration
- Comparing parameter choice methods for regularization of ill-posed problems
- Old and new parameter choice rules for discrete ill-posed problems
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- A Regularization Parameter in Discrete Ill-Posed Problems
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Random sampling of sparse trigonometric polynomials
- Scattered data reconstruction by regularization in B-spline and associated wavelet spaces
- Wavelet frame based scene reconstruction from range data
- Wavelet frame based surface reconstruction from unorganized points
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Sparse approximation of fitting surface by elastic net
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993576)
