The 2013 Newton Institute Programme on polynomial optimization
Author(s)
Letchford, Adam N; Lasserre, Jean B; Steurer, David; Letchford, Adam N.; Lasserre, Jean B.; Parrilo, Pablo A.; ... Show more Show less
Download10107_2015_886_ReferencePDF.pdf (46.19Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2015-03Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Mathematical Programming
Publisher
Springer Berlin Heidelberg
Citation
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.
Version: Author's final manuscript
ISSN
0025-5610
1436-4646