Literature
Here we present literature related to POEM.
Articles
-
S. Iliman, T. de Wolff: "Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits",
Research in the Mathematical Sciences 3(1) (2016), 1-35; see also ArXiv 1402.0462.
Was accepted for a talk at "MEGA 2015".
-
S. Iliman, T. de Wolff: "Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming",
SIAM Journal on Optimization 26 (2) (2016), 1128-1146; see also ArXiv 1402.6185.
-
M. Dressler, S. Iliman, T. de Wolff: "A Positivstellensatz for Sums of Nonnegative Circuit Polynomials"
SIAM Journal on Applied Algebra and Geometry 1 (1) (2017), 536-555; see ArXiv 1607.06010.
Was accepted for a talk at "MEGA 2017"
-
M. Dressler, S. Iliman, T. de Wolff: "An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming"
Journal of Symbolic Computation 91, (2019), 149-172 (special issue for "MEGA 2017"); see ArXiv 1602.06180.
-
H. Seidler, T. de Wolff: "An Experimental Comparison of SONC and SOS Certificates for Unconstrained Optimization",
see ArXiv 1808.08431
Was accepted for a talk at "MEGA 2019".
-
V. Magron, H. Seidler, T. de Wolff: "Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials"
Proceedings of ISSAC 2019, Beijing, China, July 15-18, 2019
(J. H. Davenport, D. Wang, M. Kauers, and R. J. Bradford (eds.)), ACM, (2019), 291-298; see also ArXiv 1902.02123.
-
M. Dressler, J. Heuer, H. Naumann, T. de Wolff: "Global Optimization via the Dual SONC Cone and Linear Programming"
Preprint; see ArXiv 2002.09368.
Theses
-
H. Müller: "Minima of Polynomials via SONC Decompositions",
Bachelor thesis, TU Berlin, 2018 (supervisor & 1st reviewer: T. de Wolff; 2nd reviewer: M. Panizzut)