Back to Results
First PageMeta Content
Convex analysis / Operations research / Convex optimization / Linear algebra / Convex function / Lipschitz continuity / Vector space / Subgradient method / Distribution / Mathematical optimization / Mathematical analysis / Mathematics


Information-theoretic lower bounds on the oracle complexity of sparse convex optimization Peter L. Bartlett Computer Science Division Department of Statistics
Add to Reading List

Document Date: 2010-11-27 20:16:44

Open Document

File Size: 202,93 KB

Share Result on Facebook

City

Berlin / New York / /

Company

Neural Information Processing Systems / Cambridge University Press / John Wiley and Sons / Computer Sciences / Oracle / /

Country

United States / /

/

Event

Bankruptcy / /

Facility

Catholic University of Louvain / /

IndustryTerm

e-prints / optimization algorithms / online optimization / focused on developing optimization algorithms / /

NaturalFeature

P[b α(MT / M∈MT / /

Organization

Cambridge University / Department of EECS / UC Berkeley / Catholic University of Louvain / Center for Operations Research and Econometrics / Peter L. Bartlett Computer Science Division Department / /

Person

Peter L. Bartlett / Lucien Le Cam / Martin J. Wainwright / John Wiley / /

ProgrammingLanguage

E / /

ProvinceOrState

Montana / /

Technology

developing optimization algorithms / /

URL

http /

SocialTag