Title	Semidefinite programming and experiment design
Creator	Vandenberghe, Lieven
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-08T13:31
Description	Semidefinite programming (SDP) has important applications in optimization problems that involve moment cones or, by duality, cones of nonnegative polynomials. Examples can be found in statistics, signal processing, control, and non-convex polynomial optimization. The talk will give an introduction to the connections between moment theory and SDP, and discuss SDP algorithms in this context. The focus will be on applications in experiment design.
Extent	46.0
Subject	Mathematics; Statistics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: UCLA
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2019-03-06
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0376637
URI	http://hdl.handle.net/2429/68490
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