Bibliography

Ahmadi, A. A. and Majumdar, A. (2017). DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization. ArXiv e-prints, arXiv:1706.02586 [math.OC]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

Ahmadi, A. A.; Dibek, C. and Hall, G. (2023). Sums of Separable and Quadratic Polynomials. Mathematics of Operations Research 48, 1316–1343. ↩¹

Barak, B. and Steurer, D. (2016). Proofs, Beliefs, and Algorithms through the Lens of Sum-of-Squares. Lecture notes. ↩¹

Blekherman, G.; Parrilo, P. A. and Thomas, R. R. (2012). Semidefinite Optimization and Convex Algebraic Geometry (Society for Industrial and Applied Mathematics, Philadelphia, PA), arXiv:http://epubs.siam.org/doi/pdf/10.1137/1.9781611972290. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹ ↩¹⁰ ↩¹¹ ↩¹²

Cartis, C. and Zhu, W. (2026). Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares. ArXiv e-prints, arXiv:2601.20418 [math.OC]. ↩¹ ↩² ↩³ ↩⁴ ↩⁵

Cox, D. A.; Little, J. and O'Shea, D. (2015). Ideals, Varieties, and Algorithms (Springer). ↩¹

Fawzi, H. (2018). On Representing the Positive Semidefinite Cone Using the Second-Order Cone. Mathematical Programming, 1–10. ↩¹

Floudas, C. A.; Pardalos, P. M.; Adjiman, C. S.; Esposito, W. R.; Gümüş, Z. H.; Harding, S. T.; Klepeis, J. L.; Meyer, C. A. and Schweiger, C. A. (1999). Handbook of Test Problems in Local and Global Optimization (Springer US). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸ ↩⁹

Goemans, M. X. and Williamson, D. P. (1995). Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM 42, 1115–1145. ↩¹

Hesse, R. (1973). A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems. Operations Research 21, 1267–1280. ↩¹

Kapelevich, L.; Coey, C. and Vielma, J. P. (2023). Sum of Squares Generalizations for Conic Sets. Mathematical Programming 199, 1417–1429. ↩¹

Lasserre, J. B. (2009). Moments, Positive Polynomials and Their Applications (Imperial College Press). ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶ ↩⁷ ↩⁸

Laurent, M. (2008). Sums of Squares, Moment Matrices and Optimization Over Polynomials. In: The IMA Volumes in Mathematics and its Applications (Springer New York); pp. 157–270. ↩¹ ↩² ↩³ ↩⁴ ↩⁵ ↩⁶

Murty, K. G. and Kabadi, S. N. (1987). Some NP-complete Problems in Quadratic and Nonlinear Programming. Mathematical Programming: Series A and B 39, 117–129. ↩¹

Papp, D. and Yıldız, S. (2017). Sum-of-Squares Optimization without Semidefinite Programming. ArXiv e-prints, arXiv:1712.01792 [math.OC]. ↩¹

Parrilo, P. A. (2003). Semidefinite Programming Relaxations for Semialgebraic Problems. Mathematical programming 96, 293–320. ↩¹