Title	The Saddle Point Problem of Polynomials
Creator	Nie, Jiawang
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-05-28T16:51
Description	This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points, based on Lasserre's hierarchy of Moment-SOS relaxations. Under some genericity assumptions, we show that: i) if there exists a saddle point, the algorithm can get one by solving a finite number of relaxations; ii) if there is no saddle point, the algorithm can detect its nonexistence.
Extent	34.0 minutes
Subject	Mathematics; Operations research, mathematical programming; Algebraic geometry; Control/Optimization/Operation Research
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of California San Diego
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-09-11
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0394321
URI	http://hdl.handle.net/2429/75978
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