Asset Details
Do you wish to reserve the book?
Conditional gradient algorithms for norm-regularized smooth convex optimization
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Conditional gradient algorithms for norm-regularized smooth convex optimization
Do you wish to request the book?
Conditional gradient algorithms for norm-regularized smooth convex optimization
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Conditional gradient algorithms for norm-regularized smooth convex optimization
2015
Overview
Motivated by some applications in signal processing and machine learning, we consider two convex optimization problems where, given a cone
K
, a norm
‖
·
‖
and a smooth convex function
f
, we want either (1) to minimize the norm over the intersection of the cone and a level set of
f
, or (2) to minimize over the cone the sum of
f
and a multiple of the norm. We focus on the case where (a) the dimension of the problem is too large to allow for interior point algorithms, (b)
‖
·
‖
is “too complicated” to allow for computationally cheap Bregman projections required in the first-order proximal gradient algorithms. On the other hand, we assume that it is relatively easy to minimize linear forms over the intersection of
K
and the unit
‖
·
‖
-ball. Motivating examples are given by the nuclear norm with
K
being the entire space of matrices, or the positive semidefinite cone in the space of symmetric matrices, and the Total Variation norm on the space of 2D images. We discuss versions of the Conditional Gradient algorithm capable to handle our problems of interest, provide the related theoretical efficiency estimates and outline some applications.
Publisher
Springer Berlin Heidelberg,Springer Nature B.V
