http://iet.metastore.ingenta.com
1887

access icon openaccess Homotopy algorithm for l 1-norm minimisation problems

  • XML
    278.7255859375Kb
  • PDF
    188.4921875Kb
  • HTML
    329.4794921875Kb
Loading full text...

Full text loading...

/deliver/fulltext/iet-spr/9/1/IET-SPR.2013.0338.html;jsessionid=2giyi3n93owxc.x-iet-live-01?itemId=%2fcontent%2fjournals%2f10.1049%2fiet-spr.2013.0338&mimeType=html&fmt=ahah

References

    1. 1)
    2. 2)
      • 2. Yang, A., Ganesh, A., Sastry, S., Ma, Y.: ‘Fast l1-minimization algorithms and an application in robust face recognition: A review’. Techical Report UCB/EECS-2010-13, EECS Department, University of California, Berkeley, February 2010.
    3. 3)
      • 3. Tibshirani, R.: ‘Regression shrinkage and selection via the Lasso’, J. R. Stat. Soc., 1996, 58, pp. 267288.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
      • 13. Hastie, T., Rosset, S., Tibshirani, R., Zhu, J.: ‘The entire regularization path for the support vector machine’, J. Mach. Learn. Res., 2004, 5, pp. 13911415.
    14. 14)
    15. 15)
    16. 16)
    17. 17)
    18. 18)
      • 18. Grant, M., Boyd, S.: ‘CVX: Matlab software for disciplined convex programming, version 1.21’, http://cvxr.com/cvx, September 2010.
    19. 19)
      • 19. Grant, M., Boyd, S.: ‘Graph implementations for nonsmooth convex programs’, in Blondel, V., Boyd, S., Kimura, H. (Eds.): ‘Recent advances in learning and control’, ser. Lecture Notes in Control and Information Sciences, (Springer-Verlag Limited, 2008), pp. 95110, http://stanford.edu/boyd/graph_dcp.html.
    20. 20)
      • 20. Frank, A., Asuncion, A.: ‘UCI machine learning repository’, 2010. [Online]. Available: http://archive.ics.uci.edu/ml.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-spr.2013.0338
Loading

Related content

content/journals/10.1049/iet-spr.2013.0338
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address