Pages that link to "Item:Q638794"
From MaRDI portal
The following pages link to The solution path of the generalized lasso (Q638794):
Displaying 50 items.
- High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) (← links)
- The sparsity of LASSO-type minimizers (Q2105124) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- Penalized polygram regression (Q2111959) (← links)
- Penalized and constrained LAD estimation in fixed and high dimension (Q2122803) (← links)
- Thresholding tests based on affine Lasso to achieve non-asymptotic nominal level and high power under sparse and dense alternatives in high dimension (Q2143028) (← links)
- \( \chi^2\) test for total variation regularization parameter selection (Q2188143) (← links)
- Primal path algorithm for compositional data analysis (Q2189589) (← links)
- Identifying local differences with fused-MCP: an apartment rental market case study on geographical segmentation detection (Q2195532) (← links)
- Two-way sparsity for time-varying networks with applications in genomics (Q2245162) (← links)
- Tensor quantile regression with application to association between neuroimages and human intelligence (Q2247495) (← links)
- Local behavior of sparse analysis regularization: applications to risk estimation (Q2252165) (← links)
- Adaptive basis expansion via \(\ell _1\) trend filtering (Q2259769) (← links)
- Boosting with structural sparsity: a differential inclusion approach (Q2278448) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- Additive models with trend filtering (Q2284363) (← links)
- Lasso meets horseshoe: a survey (Q2292393) (← links)
- Degrees of freedom in submodular regularization: a computational perspective of Stein's unbiased risk estimate (Q2293382) (← links)
- A modified generalized Lasso algorithm to detect local spatial clusters for count data (Q2316749) (← links)
- Fused comparative intervention scoring for heterogeneity of longitudinal intervention effects (Q2318660) (← links)
- PLS for Big Data: a unified parallel algorithm for regularised group PLS (Q2323935) (← links)
- A penalized regression approach for DNA copy number study using the sequencing data (Q2325029) (← links)
- On model selection consistency of regularized M-estimators (Q2340872) (← links)
- Structured regularization for conditional Gaussian graphical models (Q2361457) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
- Adaptive piecewise polynomial estimation via trend filtering (Q2448732) (← links)
- Some properties of generalized fused Lasso and its applications to high dimensional data (Q2515849) (← links)
- Generalized alternating direction method of multipliers: new theoretical insights and applications (Q2516351) (← links)
- Sparse regression with multi-type regularized feature modeling (Q2657005) (← links)
- Generic error bounds for the generalized Lasso with sub-exponential data (Q2675193) (← links)
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games (Q2682362) (← links)
- Resolvent of the parallel composition and the proximity operator of the infimal postcomposition (Q2688920) (← links)
- Selecting the tuning parameter of the \(\ell_1\) trend filter (Q2691645) (← links)
- A new method for specifying the tuning parameter of \(\ell_1\) trend filtering (Q2691769) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- On Cross-Validation for Sparse Reduced Rank Regression (Q3120104) (← links)
- Spectral Decompositions Using One-Homogeneous Functionals (Q3179608) (← links)
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising (Q3304839) (← links)
- Algorithms for Fitting the Constrained Lasso (Q3391167) (← links)
- Fused-MCP With Application to Signal Processing (Q3391169) (← links)
- Efficient Threshold Selection for Multivariate Total Variation Denoising (Q3391178) (← links)
- Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration (Q3391206) (← links)
- Solving Fused Penalty Estimation Problems via Block Splitting Algorithms (Q3391427) (← links)
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization (Q3391453) (← links)
- The DFS Fused Lasso: Linear-Time Denoising over General Graphs (Q4558501) (← links)
- False Discovery Rate Smoothing (Q4559697) (← links)
- Multiple predicting<i>K</i>-fold cross-validation for model selection (Q4634448) (← links)
- The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems (Q4640325) (← links)
