# Computing lower bounds for a polynomial using geometric programming

Presented by:
Date:
Wednesday 17th July 2013 -
15:00 to 15:30
Venue:
INI Seminar Room 1
Abstract:
We present a new algorithm for computing a new lower bound for a polynomial f in R}[X] by geometric programming. This bound is typically not as good as the lower bound obtained using Lasserre's algorithm but, on the other hand, the algorithm takes full advantage of sparsity of coefficients and it works in cases where the degree and/or number of variables is large, cases where Lasserre's algorithm breaks down. There is also variant of the algorithm which computes a lower bound for f on the semialgebraic set in real n-space defined by X_1^{2d}+\dots+X_n^{2d}
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material:
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9072833061218262, "perplexity": 861.0464326607569}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2016-30/segments/1469257826907.66/warc/CC-MAIN-20160723071026-00151-ip-10-185-27-174.ec2.internal.warc.gz"}