DECOMPOSITION AND RELAXATION ALGORITHMS FOR NONCONVEX MIXED INTEGER QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming	2018	Tiago Andrade Fabrício Oliveira Sílvio Hamacher Andrew Eberhard
+	Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part II	2023	Benjamin Beach Robert Burlacu Andreas Barmann Lukas Hager Robert Hildebrand
+ PDF Chat	Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II	2024	Benjamin Beach Robert Burlacu Andreas Bärmann Lukas Hager Robert Hildebrand
+ PDF Chat	Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I	2024	Benjamin Beach Robert Burlacu Andreas Bärmann Lukas Hager Robert Hildebrand
+	Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation	2016	Pedro M. Castro
+	Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part I	2022	Andreas Bärmann Benjamin Beach Robert Burlacu Lukas Hager Robert Hildebrand
+ PDF Chat	The p-Lagrangian relaxation for separable nonconvex MIQCQP problems	2022	Tiago Andrade Nikita Belyak Andrew Eberhard Sílvio Hamacher Fabrício Oliveira
+	Novel Relaxation Techniques for Global Optimization of NLPs and MINLPs	2020	Nohra Khouri Jose Carlos
+ PDF Chat	Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems	2014	Pedro M. Castro Ignacio E. Grossmann
+ PDF Chat	Global optimization of bilinear programs with a multiparametric disaggregation technique	2013	Scott Kolodziej Pedro M. Castro Ignacio E. Grossmann
+	Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations	2010	Anureet Saxena Pierre Bonami Jon Lee
+ PDF Chat	A Convexication-based Outer-approximation Method for Convex and Nonconvex MINLP	2024	Zedong Peng Kaiyu Cao Kevin C. Furman Can Li Ignacio E. Grossmann David E. Bernal Neira
+ PDF Chat	Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques	2019	Wei Xia Juan C. Vera Luis F. Zuluaga
+	Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems	2015	Pedro M. Castro
+	Spatial branch and bound algorithm for the global optimization of MIQCPs	2016	Pedro M. Castro
+	Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations	2018	Jacek Gondzio Esma Yildirim
+	Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations	2018	Jacek Gondzio E. Alper Yıldırım
+	A Generalized Benders Decomposition for Mixed-Integer Nonlinear Programming: Theory and Applications	2024	Fazal Haq Diah Chaerani Anita Triska
+	A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs	2018	Emmanuel Ogbe Xiang Li
+ PDF Chat	The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming	2020	Pavlo Muts Ivo Nowak E.M.T. Hendrix

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (52)

Action	Title	Year	Authors
+	Real and Complex Analysis.	1987	G. A. Garreau Walter Rudin
+ PDF Chat	Tightening piecewise McCormick relaxations for bilinear problems	2014	Pedro M. Castro
+ PDF Chat	Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs	2011	Xiang Li Asgeir Tomasgård Paul I. Barton
+	First Order Conditions for General Nonlinear Optimization	1976	Stephen M. Robinson
+	Non-Linear Programming Via Penalty Functions	1967	Willard I. Zangwill
+	Newton's method for convex programming and Tchebycheff approximation	1959	E. W. Cheney A. A. Goldstein
+ PDF Chat	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming	1995	Michel X. Goemans David P. Williamson
+	Lagrange Multipliers and Optimality	1993	R. T. Rockafellar
+ PDF Chat	Multi-parametric disaggregation technique for global optimization of polynomial programming problems	2011	João P. Teles Pedro M. Castro Henrique A. Matos
+	Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems	1976	Garth P. McCormick