The 2013 Newton Institute Programme on polynomial optimization
The rapidly growing field of polynomial optimisation (PO) is concerned with optimisation problems in which the objective and constraint functions are all polynomials. There are applications of PO in a surprisingly wide variety of contexts, including, for example, operational research, statistics, ap...
Main Authors: | , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2016
|
Online Access: | http://hdl.handle.net/1721.1/103402 https://orcid.org/0000-0003-1132-8477 |
_version_ | 1826201921230209024 |
---|---|
author | Letchford, Adam N Lasserre, Jean B Steurer, David Letchford, Adam N. Lasserre, Jean B. Parrilo, Pablo A. |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Letchford, Adam N Lasserre, Jean B Steurer, David Letchford, Adam N. Lasserre, Jean B. Parrilo, Pablo A. |
author_sort | Letchford, Adam N |
collection | MIT |
description | The rapidly growing field of polynomial optimisation (PO) is concerned with optimisation problems in which the objective and constraint functions are all polynomials. There are applications of PO in a surprisingly wide variety of contexts, including, for example, operational research, statistics, applied probability, quantitative finance, theoretical computer science and various branches of engineering and the physical sciences. Not only that, but current research on PO is remarkably inter-disciplinary in nature, involving researchers from all of the above-mentioned disciplines, together with several branches of mathematics including graph theory, numerical analysis, algebraic geometry, commutative algebra and moment theory. |
first_indexed | 2024-09-23T11:59:24Z |
format | Article |
id | mit-1721.1/103402 |
institution | Massachusetts Institute of Technology |
language | English |
last_indexed | 2024-09-23T11:59:24Z |
publishDate | 2016 |
publisher | Springer Berlin Heidelberg |
record_format | dspace |
spelling | mit-1721.1/1034022022-10-01T07:28:18Z The 2013 Newton Institute Programme on polynomial optimization Letchford, Adam N Lasserre, Jean B Steurer, David Letchford, Adam N. Lasserre, Jean B. Parrilo, Pablo A. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Parrilo, Pablo A. The rapidly growing field of polynomial optimisation (PO) is concerned with optimisation problems in which the objective and constraint functions are all polynomials. There are applications of PO in a surprisingly wide variety of contexts, including, for example, operational research, statistics, applied probability, quantitative finance, theoretical computer science and various branches of engineering and the physical sciences. Not only that, but current research on PO is remarkably inter-disciplinary in nature, involving researchers from all of the above-mentioned disciplines, together with several branches of mathematics including graph theory, numerical analysis, algebraic geometry, commutative algebra and moment theory. 2016-06-30T20:33:24Z 2016-06-30T20:33:24Z 2015-03 2016-05-23T12:11:08Z Article http://purl.org/eprint/type/JournalArticle 0025-5610 1436-4646 http://hdl.handle.net/1721.1/103402 Letchford, Adam N., Jean B. Lasserre, Pablo A. Parrilo, and David Steurer. “The 2013 Newton Institute Programme on Polynomial Optimization.” Math. Program. 151, no. 2 (March 13, 2015): 375–377. https://orcid.org/0000-0003-1132-8477 en http://dx.doi.org/10.1007/s10107-015-0886-1 Mathematical Programming Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society application/pdf Springer Berlin Heidelberg Springer Berlin Heidelberg |
spellingShingle | Letchford, Adam N Lasserre, Jean B Steurer, David Letchford, Adam N. Lasserre, Jean B. Parrilo, Pablo A. The 2013 Newton Institute Programme on polynomial optimization |
title | The 2013 Newton Institute Programme on polynomial optimization |
title_full | The 2013 Newton Institute Programme on polynomial optimization |
title_fullStr | The 2013 Newton Institute Programme on polynomial optimization |
title_full_unstemmed | The 2013 Newton Institute Programme on polynomial optimization |
title_short | The 2013 Newton Institute Programme on polynomial optimization |
title_sort | 2013 newton institute programme on polynomial optimization |
url | http://hdl.handle.net/1721.1/103402 https://orcid.org/0000-0003-1132-8477 |
work_keys_str_mv | AT letchfordadamn the2013newtoninstituteprogrammeonpolynomialoptimization AT lasserrejeanb the2013newtoninstituteprogrammeonpolynomialoptimization AT steurerdavid the2013newtoninstituteprogrammeonpolynomialoptimization AT letchfordadamn the2013newtoninstituteprogrammeonpolynomialoptimization AT lasserrejeanb the2013newtoninstituteprogrammeonpolynomialoptimization AT parrilopabloa the2013newtoninstituteprogrammeonpolynomialoptimization AT letchfordadamn 2013newtoninstituteprogrammeonpolynomialoptimization AT lasserrejeanb 2013newtoninstituteprogrammeonpolynomialoptimization AT steurerdavid 2013newtoninstituteprogrammeonpolynomialoptimization AT letchfordadamn 2013newtoninstituteprogrammeonpolynomialoptimization AT lasserrejeanb 2013newtoninstituteprogrammeonpolynomialoptimization AT parrilopabloa 2013newtoninstituteprogrammeonpolynomialoptimization |