Cone Product Reformulation for Global Optimization

References

• Anstreicher K (2017) Kronecker product constraints with an application to the two-trust-region subproblem. SIAM J. Optim. 27(1):368–378.Crossref, Google Scholar
• Bertsimas D, Den Hertog D (2022) Robust and Adaptive Optimization (Dynamic Ideas LLC, Belmont, MA).Google Scholar
• Bertsimas D, de Moor D, den Hertog D, Koukouvinos T, Zhen J (2023) A novel algorithm for a broad class of nonconvex optimization problems. Optimization Online. Accessed December 23, 2025, https://optimization-online.org/?p=23399.Google Scholar
• Bertsimas D, de Moor D, den Hertog D, Koukouvinos T, Zhen J (2026) Cone product reformulation for global optimization. https://doi.org/10.1287/ijoc.2023.0345.cd, https://github.com/INFORMSJoC/2023.0345.Google Scholar
• de Moor D, Wagenaar J, Poos R, den Hertog D, Fleuren H (2024) A robust approach to food aid supply chains. Eur. J. Oper. Res. 318(1):269–285.Crossref, Google Scholar
• Gorissen B, Den Hertog D, Reusken M (2025) Hidden convexity in a class of optimization problems with bilinear terms. Oper. Res., ePub ahead of print July 21, https://doi.org/10.1287/opre.2022.0383.Google Scholar
• Gurobi Optimization (2019) Gurobi optimizer reference manual, version 8.1.1. http://www.gurobi.com.Google Scholar
• Jiang R, Li D (2019) Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming. J. Global Optim. 75:461–494.Crossref, Google Scholar
• Jiang R, Li D (2020) Semidefinite programming based convex relaxation for nonconvex quadratically constrained quadratic programming. Le Thi HA, Le HM, Pham Dinh T, eds. Optimization of Complex Systems: Theory, Models, Algorithms and Applications (Springer International Publishing, Cham, Switzerland), 213–220.Crossref, Google Scholar
• Maragno D, Wiberg H, Bertsimas D, Birbil Şİ, den Hertog D, Fajemisin AO (2023) Mixed-integer optimization with constraint learning. Oper. Res. 73(2):1011–1028.Link, Google Scholar
• MOSEK ApS (2020) The MOSEK optimization toolbox for MATLAB manual, version 9.2. MOSEK ApS (July 19), http://docs.mosek.com/9.2/toolbox.pdf.Google Scholar
• Mutapcic A, Boyd S (2009) Cutting-set methods for robust convex optimization with pessimizing oracles. Optim. Methods Software 24(3):381–406.Crossref, Google Scholar
• Peters K, Silva S, Wolter T, Anjos L, van Ettekoven N, Combette E, Melchiori A, Fleuren H, den Hertog D, Ergun Ö (2022) Un world food programme: Toward zero hunger with analytics. INFORMS J. Appl. Anal. 52(1):8–26.Link, Google Scholar
• Rockafellar R (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Roos E, den Hertog D, Ben-Tal A, de Ruiter F, Zhen J (2018) Tractable approximation of hard uncertain optimization problems. Accessed August 25, 2022, https://optimization-online.org/?p=15245.Google Scholar
• Sahinidis N (1996) Baron: A general purpose global optimization software package. J. Global Optim. 8(2):201–205.Crossref, Google Scholar
• Serrano S (2015) Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone. Unpublished PhD thesis, Stanford University, CA.Google Scholar
• Sherali H, Adams W (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411–430.Crossref, Google Scholar
• Sherali H, Tuncbilek C (1992) A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2:101–112.Crossref, Google Scholar
• Sherali H, Tuncbilek C (1995) A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7:1–31.Crossref, Google Scholar
• Sturm J, Zhang S (2003) On cones of nonnegative quadratic functions. Math. Oper. Res. 28(2):246–267.Link, Google Scholar