Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set
From MaRDI portal
Publication:5084430
Cites work
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Cluster Analysis Method for Grouping Means in the Analysis of Variance
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- Algorithms for the optimal identification of segment neighborhoods
- Atomic Decomposition by Basis Pursuit
- Best subset selection via a modern optimization lens
- Low-rank matrix completion using nuclear norm minimization and facial reduction
- Matching pursuits with time-frequency dictionaries
- Nearly unbiased variable selection under minimax concave penalty
- On optimal multiple changepoint algorithms for large data
- On the approximation of curves by line segments using dynamic programming
- Optimal detection of changepoints with a linear computational cost
- SparseNet: coordinate descent with nonconvex penalties
- Using penalized contrasts for the change-point problem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084430)
