Optimization methods for regularized convex formulations in machine learning

We develop efficient numerical optimization algorithms for regularized convex formulations that appear in a variety of areas such as machine learning, statistics, and signal processing. Their objective functions consist of a loss term and a regularization term, where the latter controls the complexi...

Full description

Saved in:

Bibliographic Details
Main Author:	Lee, Sang Kyun
Format:	Dissertation
Language:	English
Published:	ProQuest Dissertations & Theses 01.01.2011
Subjects:	Computer science
ISBN:	9781267055095, 126705509X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!