Table of Contents
Journal of Applied Mathematics and Decision Sciences
Volume 2007, Article ID 24053, 13 pages
http://dx.doi.org/10.1155/2007/24053
Research Article

On Solving Lq-Penalized Regressions

1JPMorgan Chase Bank, 1111 Polaris Pkwy, Columbus, OH 43240, USA
2Department of Quantitative Analysis and Operations Management, University of Cincinnati, P.O. Box 210130, Cincinnati, OH 45221, USA
3ABN AMRO Bank, 250 Bishopsgate, London EC2M 4AA, UK

Received 1 November 2006; Accepted 18 July 2007

Academic Editor: Fernando Beltran

Copyright © 2007 Tracy Zhou Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. E. Hoerl and R. W. Kennard, “Ridge regression: biased estimation for nonorthogonal problems,” Technometrics, vol. 12, no. 1, pp. 55–67, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. I. Frank and J. Friedman, “A statistical view of some chemometrics regression tools,” Technometrics, vol. 35, no. 2, pp. 109–135, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. R. Tibshirani, “Regression shrinkage and selection via the LASSO,” Journal of the Royal Statistical Society. Series B, vol. 58, no. 1, pp. 267–288, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. W. J. Fu, “Penalized regressions: the bridge versus the lasso,” Journal of Computational and Graphical Statistics, vol. 7, no. 3, pp. 397–416, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  5. D. Ruppert and R. J. Carroll, “Penalized regression splines,” preprint, 1997, http://legacy.orie.cornell.edu/~davidr/papers/srsrev02.pdf.
  6. M. R. Osborne, B. Presnell, and B. A. Turlach, “On the LASSO and its dual,” Journal of Computational and Graphical Statistics, vol. 9, no. 2, pp. 319–337, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  7. M. R. Osborne, B. Presnell, and B. A. Turlach, “A new approach to variable selection in least squares problems,” IMA Journal of Numerical Analysis, vol. 20, no. 3, pp. 389–403, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,” The Annals of Statistics, vol. 32, no. 2, pp. 407–499, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. J. J. Moré and D. C. Sorensen, “Computing a trust region step,” SIAM Journal on Scientific and Statistical Computing, vol. 4, no. 3, pp. 553–572, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. A. R. Conn, N. I. M. Gould, and P. L. Toint, Trust-Region Methods, MPS/SIAM Series on Optimization, SIAM, Philadelphia, Pa, USA, 2000. View at Zentralblatt MATH · View at MathSciNet
  11. T. F. Coleman and Y. Li, “An interior trust region approach for nonlinear minimization subject to bounds,” SIAM Journal on Optimization, vol. 6, no. 2, pp. 418–445, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. M. K. Kozlov, S. P. Tarasov, and L. G. Hačijan, “Polynomial solvability of convex quadratic programming,” Soviet Mathematics Doklady, vol. 20, pp. 1108–1111, 1979. View at Google Scholar · View at Zentralblatt MATH
  13. S. J. Chung and K. G. Murty, “Polynomially bounded ellipsoid algorithms for convex quadratic programming,” in Nonlinear Programming (Madison, Wis, USA, 1980), vol. 4, pp. 439–485, Academic Press, New York, NY, USA, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. Y. Ye and E. Tse, “An extension of Karmarkar's projective algorithm for convex quadratic programming,” Mathematical Programming, vol. 44, no. 2, pp. 157–179, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. C. Lin and J. J. More, “Newton's method for large bound-constrained optimization problems,” Tech. Rep. ANL/MCS-P724-0898, Mathematical and Computer Sciences Division, Argonne National Laboratories, Argonne, Ill, USA, 1998. View at Google Scholar
  16. J. J. Moré and G. Toraldo, “Algorithms for bound constrained quadratic programming problems,” Numerische Mathematik, vol. 55, no. 4, pp. 377–400, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. T. F. Coleman and Y. Li, “A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables,” SIAM Journal on Optimization, vol. 6, no. 4, pp. 1040–1058, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. P. J. Green and B. W. Silverman, Nonparametric Regression and Generalized Linear Models, vol. 58 of Monographs on Statistics and Applied Probability, Chapman & Hall, London, UK, 1994. View at Zentralblatt MATH · View at MathSciNet
  19. B. W. Silverman, “Some aspects of the spline smoothing approach to nonparametric regression curve fitting,” Journal of the Royal Statistical Society. Series B, vol. 47, no. 1, pp. 1–52, 1985. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet