Feasibility Verification and Upper Bound Computation in Global Minimization Using Approximate Active Index Sets

References

• Achterberg T (2009) SCIP: Solving constraint integer programs. Math. Programming Comput. 1:1–41.Crossref, Google Scholar
• Adjiman C, Androulakis I, Floudas C (1998a) A global optimization method, αbb, for general twice-differentiable NLPs: II. Implementation and computational results. Comput. Chemical Engrg. 22(9):1159–1179.Crossref, Google Scholar
• Adjiman C, Dallwig S, Floudas C, Neumaier A (1998b) A global optimization method, αbb, for general twice-differentiable NLPs: I. Theoretical advances. Comput. Chemical Engrg. 22(9):1137–1158.Crossref, Google Scholar
• Androsov A (2021) IntvalPy. Code released on GitHub. https://github.com/AndrosovAS/intvalpy/.Google Scholar
• Androulakis I, Maranas C, Floudas C (1995) αbb: A global optimization method for general constrained nonconvex problems. J. Global Optim. 7:337–363.Crossref, Google Scholar
• Belotti P, Lee J, Liberti L, Margot F, Wächter A (2009) Branching and bounds tightening techniques for non-convex minlp. Optim. Methods Software 24(4–5):597–634.Crossref, Google Scholar
• Berthold T, Gleixner AM (2014) Undercover: A primal MINLP heuristic exploring a largest sub-MIP. Math. Programming Ser. A 144:315–346.Crossref, Google Scholar
• Bonami P, Cornuéjols G, Lodi A, Margot F (2009) A feasibility pump for mixed integer nonlinear programs. Math. Programming Ser. A 119:331–352.Crossref, Google Scholar
• Domes F, Neumaier A (2015) Rigorous verification of feasibility. J. Global Optim. 61:255–278.Crossref, Google Scholar
• Falk JE, Soland RM (1969) An algorithm for separable nonconvex programming problems. Management Sci. 15(9):550–569.Link, Google Scholar
• Floudas C (2000) Deterministic global optimization: Theory, algorithms and applications. Nonconvex Optimization and Its Applications (Kluwer Academic Publishers, Dordrecht, Netherlands), 309–554.Google Scholar
• Floudas C, Gounaris C (2009) A review of recent advances in global optimization. J. Global Optim. 45:3–38.Crossref, Google Scholar
• Füllner C, Kirst P, Stein O (2021) Convergent upper bounds in global minimization with nonlinear equality constraints. Math. Programming 187:617–651.Crossref, Google Scholar
• Füllner C, Kirst P, Otto H, Rebennack S (2024) Repository to “Feasibility verification and upper bound computation using approximate active index sets.” https://dx.doi.org/10.1287/ijoc.2023.0162.cd, https://github.com/INFORMSJoC/2023.0162.Google Scholar
• Gleixner AM, Berthold T, Müller B, Weltge S (2017) Three enhancements for optimization-based bound tightening. J. Global Optim. 67:731–757.Crossref, Google Scholar
• Horst R, Tuy H (1996) Global Optimization: Deterministic Approaches (Springer, Berlin).Crossref, Google Scholar
• Jongen HT, Stein O (2003) On the complexity of equalizing inequalities. J. Global Optim. 27:367–374.Crossref, Google Scholar
• Jongen HT, Jonker P, Twilt F (1986) Critical sets in parametric optimization. Math. Programming 34:333–353.Crossref, Google Scholar
• Kearfott RB (1998) On proving existence of feasible points in equality constrained optimization problems. Math. Programming 83:89–100.Crossref, Google Scholar
• Kearfott RB (2014) On rigorous upper bounds to a global optimum. J. Global Optim. 59:459–476.Crossref, Google Scholar
• Kirst P, Stein O, Steuermann P (2015) Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints. TOP 23:591–616.Crossref, Google Scholar
• Kraft D (1988) A software package for sequential quadratic programming. Technical report, Deutsche Forschungs- und Versuchsanstalt für Luft- und Raumfahrt, Institut für Dynamik der Flugsysteme, Oberpfaffenhofen, Germany.Google Scholar
• Krawczyk R (1969) Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing 4:187–201.Crossref, Google Scholar
• Krawczyk R, Nickel K (1982) Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und Inklusionsisotonie. Computing 28:117–137.Crossref, Google Scholar
• Lin Y, Schrage L (2009) The global solver in the LINDO API. Optim. Methods Software 24:657–668.Google Scholar
• Locatelli M, Schoen F (2013) Global Optimization: Theory, Algorithms and Applications. MOS-SIAM Series on Optimization (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Miranda C (1940) Un’ osservazione su una teorema di Brouwer. Bollettino dell’Unione Matematica Italiana 3:5–7.Google Scholar
• Misener R, Floudas C (2014) Antigone: Algorithms for continuous/integer global optimization of nonlinear equations. J. Global Optim. 59(2–3):503–526.Crossref, Google Scholar
• Moore RE, Kearfott RB, Cloud MJ (2009) Introduction to Interval Analysis. Other Titles in Applied Mathematics (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Neumaier A (1990) Interval Methods for Systems of Equations (Cambridge University Press, Cambridge, UK).Google Scholar
• Puranik Y, Sahinidis NV (2017) Domain reduction techniques for global NLP and MINLP optimization. Constraints 22:338–376.Crossref, Google Scholar
• Ryoo H, Sahinidis N (1996) A branch-and-reduce approach to global optimization. J. Global Optim. 8:107–138.Crossref, Google Scholar
• Ryoo HS, Sahinidis NV (1995) Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chemical Engrg. 19(5):551–566.Crossref, Google Scholar
• Sahinidis NV (1996) BARON: A general purpose global optimization software package. J. Global Optim. 8:201–205.Crossref, Google Scholar
• Shcherbina O, Neumaier A, Sam-Haroud D, Vu XH, Nguyen TV (2003) Benchmarking global optimization and constraint satisfaction codes. Global Optimization and Constraint Satisfaction (Springer, Berlin), 211–222.Crossref, Google Scholar
• Smith E, Pantelides C (1997) Global optimisation of non-convex MINLPs. Comput. Chemical Engrg. 21(Supplement):S791–S796.Crossref, Google Scholar
• Smith E, Pantelides C (1999) A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex minlps. Comput. Chemical Engrg. 23(4–5):457–478.Crossref, Google Scholar
• Tawarmalani M, Sahinidis N (2002a) Convex extensions and envelopes of lower semi-continuous functions. Math. Programming 93:247–263.Crossref, Google Scholar
• Tawarmalani M, Sahinidis N (2002b) Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Nonconvex Optimization and Its Applications (Kluwer Academic Publishers, Dordrecht, Netherlands).Crossref, Google Scholar
• Tawarmalani M, Sahinidis N (2004) Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Programming 99:563–591.Crossref, Google Scholar
• Tawarmalani M, Sahinidis N (2005) A polyhedral branch-and-cut approach to global optimization. Math. Programming 103:225–249.Crossref, Google Scholar
• Tuy H (2010) D(C)-optimization and robust global optimization. J. Global Optim. 47:485–501.Crossref, Google Scholar
• Tuy H, Rebennack S, Pardalos P (2013) Global optimization. Gass S, Fu M, eds. Encyclopedia of Operations Research and Management Science (Springer, Berlin), 650–658.Crossref, Google Scholar
• Vigerske S, Gleixner A (2018) SCIP: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Software 33(3):563–593.Crossref, Google Scholar
• Wächter A, Biegler LT (2006) On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar