A New Maximum Likelihood Algorithm for Piecewise Regression
From MaRDI portal
Publication:3928993
Cited in
(21)- Change point models for cognitive tests using semi-parametric maximum likelihood
- Bent-cable asymptotics when the bend is missing.
- A smoothing-out technique for min—max optimization
- Simultaneous confidence band for the difference of segmented linear models
- Bayesian analysis of switching regression models
- Fast grid search and bootstrap-based inference for continuous two-phase polynomial regression models
- Least squares estimation of linear splines with unknown knot locations
- Estimation of Knots in Linear Spline Models
- Testing for unit roots in a Bayesian framework
- Switching regressions and activity analysis. A new approach to frontier estimation
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Statistical modeling of changes in relative sea level in Maine during the Holocene Era
- Asymptotic theory for bent-cable regression -- the basic case
- A min-max algorithm for non-linear regression models
- Two-component generalized bent-cable models
- A Bayesian analysis of some threshold switching models
- Longitudinal mixed-effects models for latent cognitive function
- Penalized likelihood regression for generalized linear models with non-quadratic penalties
- Joint mixture quantile regressions and time-to-event analysis
- Change-point problems: bibliography and review
- A heuristic, iterative algorithm for change-point detection in abrupt change models
This page was built for publication: A New Maximum Likelihood Algorithm for Piecewise Regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3928993)
