Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
From MaRDI portal
Publication:3396382
DOI10.1080/10556780902883184zbMath1179.90252OpenAlexW2056337104MaRDI QIDQ3396382
Xiaowei Bao, Mohit Tawarmalani, Nikolaos V. Sahinidis
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780902883184
Related Items
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, On conic QPCCs, conic QCQPs and completely positive programs, A fair division approach to humanitarian logistics inspired by conditional value-at-risk, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Solving generalized polynomial problem by using new affine relaxed technique, On linear programming relaxations for solving polynomial programming problems, Large-scale standard pooling problems with constrained pools and fixed demands, On decomposability of multilinear sets, GLOMIQO: global mixed-integer quadratic optimizer, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Some results on the strength of relaxations of multilinear functions, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Outer-product-free sets for polynomial optimization and oracle-based cuts, Convex envelopes generated from finitely many compact convex sets, Using general triangle inequalities within quadratic convex reformulation method, Domain reduction techniques for global NLP and MINLP optimization, Convex envelopes of products of convex and component-wise concave functions, Explicit convex and concave envelopes through polyhedral subdivisions, Improved convex and concave relaxations of composite bilinear forms, Relaxations of factorable functions with convex-transformable intermediates, Convex and concave envelopes: revisited and new perspectives, Extended formulations for convex envelopes, The Multilinear Polytope for Acyclic Hypergraphs, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Global solution of non-convex quadratically constrained quadratic programs, Relaxations and discretizations for the pooling problem, Global optimization algorithm for mixed integer quadratically constrained quadratic program, Global optimization, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Global optimization of general nonconvex problems with intermediate polynomial substructures, Global optimization of nonconvex problems with convex-transformable intermediates, A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Global optimization of general non-convex problems with intermediate bilinear substructures, Tuning BARON using derivative-free optimization algorithms, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, The Running Intersection Relaxation of the Multilinear Polytope, On tackling reverse convex constraints for non-overlapping of unequal circles, Convex envelopes for ray-concave functions, On the Composition of Convex Envelopes for Quadrilinear Terms, Probability estimation via policy restrictions, convexification, and approximate sampling, Global optimization of nonconvex problems with multilinear intermediates
Uses Software
