Back to Results
First PageMeta Content
Operations research / Mathematical optimization / Support vector machines / Convex optimization / Statistical classification / Sequential minimal optimization / Linear programming / Time complexity / Dynamic programming / Mathematics / Algebra / Theoretical computer science


Lower Bounds on Rate of Convergence of Cutting Plane Methods Xinhua Zhang Dept. of Computing Science University of Alberta
Add to Reading List

Document Date: 2010-11-03 13:50:24


Open Document

File Size: 366,09 KB

Share Result on Facebook

Company

SIAM Journal / Neural Information Processing Systems / John Wiley and Sons / Microsoft / /

/

Facility

Computing Science University / /

IndustryTerm

steepest-descent line search / optimization algorithm / linear time algorithm / batch algorithms / higher order algorithms / expected linear time algorithm / line search / /

NaturalFeature

0≤t≤k falls / /

OperatingSystem

Pegasos / /

Organization

Canadian Mathematical Society / University of Chicago / University of Alberta / Purdue University / /

Person

Proc / /

Position

Y. Singer / and N. Srebro / Y. Singer / and T. Chandra / /

ProvinceOrState

Alberta / /

PublishedMedium

Machine Learning / /

RadioStation

CORE / /

Technology

3 Algorithms / 2 Algorithm / SVM-Perf algorithm / expected linear time algorithm / Data Mining / linear time algorithm / machine learning / higher order algorithms / inner loop Algorithm / batch algorithms / optimization algorithm / pdf / /

URL

http /

SocialTag