Show simple item record

dc.contributor.authorHanzely, Filip
dc.contributor.authorRichtárik, Peter
dc.date.accessioned2017-05-31T11:53:47Z
dc.date.available2017-05-31T11:53:47Z
dc.date.issued2017-04-11
dc.identifier.urihttp://hdl.handle.net/10754/623944
dc.titleExtending the Reach of Big Data Optimization: Randomized Algorithms for Minimizing Relatively Smooth Functions
dc.typePoster
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.conference.dateApril 10-12, 2017
dc.conference.nameKAUST Research Conference 2017: Visual Computing – Modeling and Reconstruction
dc.conference.locationKAUST
dc.contributor.institutionUniversity of Edinburgh
kaust.personHanzely, Filip
refterms.dateFOA2018-06-14T04:39:21Z


Files in this item

This item appears in the following Collection(s)

Show simple item record