Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Michael R. Osborne"'
Autor:
Michael R. Osborne, Berwin A. Turlach
Publikováno v:
Journal of Computational and Graphical Statistics. 20:972-987
We show that the homotopy algorithm of Osborne, Presnell, and Turlach (2000), which has proved such an effective optimal path following method for implementing Tibshirani’s “lasso” for variable selection in least squares estimation problems, ca
Autor:
Michael R. Osborne
Publikováno v:
Optimization Methods and Software. 21:943-959
The Gauss–Newton algorithm for solving nonlinear least squares problems proves particularly efficient for solving parameter estimation problems when the number of independent observations is large and the fitted model is appropriate. In this contex
Publikováno v:
IMA Journal of Numerical Analysis. 25:264-285
This paper addresses the development of a new algorithm for parameter estimation of ordinary differential equations. Here, we show that (1) the simultaneous approach combined with orthogonal cyclic reduction can be used to reduce the estimation probl
Publikováno v:
The ANZIAM Journal. 45:91-114
This paper describes a SQP-type algorithm for solving a constrained maximum likelihood estimation problem that incorporates a number of novel features. We call it MLESOL. MLESOL maintains the use of an estimate of the Fisher information matrix to the
Publikováno v:
Journal of Optimization Theory and Applications. 114:423-441
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for so
Publikováno v:
Annals of Operations Research. 108:75-85
The predictor–corrector interior-point path-following algorithm is promising in solving multistage convex programming problems. Among many other general good features of this algorithm, especially attractive is that the algorithm allows possibility
Publikováno v:
Scopus-Elsevier
We investigate one of the possible ways for improving Friedman’s Multivariate Adaptive Regression Splines (MARS) algorithm designed for flexible modelling of high-dimensional data. In our version of MARS called BMARS we use B-splines instead of tru
Publikováno v:
IMA Journal of Numerical Analysis. 20:389-403
The title Lasso has been suggested by Tibshirani (1996) as a colourful name for a technique of variable selection which requires the minimization of a sum of squares subject to an l 1 bound κ on the solution. This forces zero components in the minim
Autor:
Michael R. Osborne
Publikováno v:
The ANZIAM Journal. 42:9-25
This paper considers the solution of estimation problems based on the maximum likelihood principle when a fixed number of equality constraints are imposed on the parameters of the problem. Consistency and the asymptotic distribution of the parameter
Publikováno v:
Journal of Computational and Graphical Statistics. 9:319-337
Proposed by Tibshirani, the least absolute shrinkage and selection operator (LASSO) estimates a vector of regression coefficients by minimizing the residual sum of squares subject to a constraint on the l 1-norm of the coefficient vector. The LASSO e