Title	Faster algorithms for line search in the submodular base polytope
Creator	Ene, Alina
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-11-14T15:56
Description	We consider the line search problem in the base polytope of a submodular function: given a submodular function f and a direction a, the goal is to find the maximum value t such that f - t * a is non-negative. Recently, Gupta et al. [ICPO 2017] showed that the discrete Newton algorithm solves this problem using n^2 submodular function minimizations. In this talk, we present a faster algorithm for the problem. The talk is based on joint work with Huy Nguyen (Northeastern University) and Laszlo Vegh (London School of Economics).
Extent	35 minutes
Subject	Mathematics; Computer science; Operations research, mathematical programming; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Boston University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-05-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0366270
URI	http://hdl.handle.net/2429/65838
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos