Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach

Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This approach is based on the minimization of the sum of empirical squared errors, subject to the constraints implied by Lipschitz continuity. The resulting optimization problem has a convex objective function and linear constraints, and as a result, is efficiently solvable. The estimated function computed by this technique, is proven to converge to the underlying regression function uniformly and almost surely, when the sample size grows to infinity, thus providing a very strong form of consistency. We also propose a convex optimization approach to the maximum likelihood estimation of unknown parameters in statistical models, where the parameters depend continuously on some observable input variables. For a number of classical distributional forms, the objective function in the underlying optimization problem ...

• Type: Conference
• Year: 1997
• Where: COLT
• Authors: Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis
• Keywords: COLT 1997, Convex Objective Function, Convex Optimization Approach, Machine Learning, Regression Function