Non UBC
DSpace
Riley Murray
2019-11-28T13:14:55Z
2019-05-31T11:01
The Sums-of-AM/GM-Exponential (SAGE) approach to signomial and polynomial nonnegativity is a powerful proof system based on convex duality and the relative entropy function. In this talk I provide a brief derivation of SAGE certificates for signomials, and review some recent results for SAGE signomials and SAGE polynomials. I will conclude with a small preview of upcoming work: how the "signomial representatives" underlying SAGE polynomials lead to an effective algorithm for solution recovery to moment-SAGE relaxations in polynomial optimization.
https://circle.library.ubc.ca/rest/handle/2429/72459?expand=metadata
33.0 minutes
video/mp4
Author affiliation: CalTech
Banff (Alta.)
10.14288/1.0386019
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Graduate
BIRS Workshop Lecture Videos (Banff, Alta)
Mathematics
Operations Research, Mathematical Programming, Algebraic Geometry, Control/Optimization/Operation Research
SAGE certificates for signomial and polynomial nonnegativity
Moving Image
http://hdl.handle.net/2429/72459