Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
From MaRDI portal
Publication:2943816
DOI10.1080/10556788.2014.916287zbMath1325.90071OpenAlexW2065849120WikidataQ62015629 ScholiaQ62015629MaRDI QIDQ2943816
Ruth Misener, Christodoulos A. Floudas, James B. Smadbeck
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Dynamically_generated_cutting_planes_for_mixed_integer_quadratically_constrained_quadratic_programs_and_their_incorporation_into_GloMIQO_2/1310478
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, A disjunctive cut strengthening technique for convex MINLP, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, On decomposability of multilinear sets, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, A computational study of global optimization solvers on two trust region subproblems, Tractable Relaxations of Composite Functions, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Error bounds for monomial convexification in polynomial optimization, A framework for globally optimizing mixed-integer signomial programs, Outer-product-free sets for polynomial optimization and oracle-based cuts, Using general triangle inequalities within quadratic convex reformulation method, The Convex Hull of a Quadratic Constraint over a Polytope, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, A new framework to relax composite functions in nonlinear programs, Global solution of non-convex quadratically constrained quadratic programs, Relaxations and discretizations for the pooling problem, Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, The Running Intersection Relaxation of the Multilinear Polytope, GloMIQO, Extended formulations for convex hulls of some bilinear functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A framework for globally optimizing mixed-integer signomial programs
- Branch-and-bound approaches to standard quadratic optimization problems
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Concave extensions for nonlinear 0-1 maximization problems
- SCIP: solving constraint integer programs
- A review of recent advances in global optimization
- A survey for the quadratic assignment problem
- The small octagon with longest perimeter
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- An exact algorithm for the maximum clique problem
- Existence and sum decomposition of vertex polyhedral convex envelopes
- An algorithmic framework for convex mixed integer nonlinear programs
- A clique algorithm for standard quadratic programming
- Cutting circles and polygons from area-minimizing rectangles
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Recognition problems for special classes of polynomials in 0-1 variables
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- A new reformulation-linearization technique for bilinear programming problems
- Test case generators and computational results for the maximum clique problem
- A remark on the GOP algorithm for global optimization
- The maximum clique problem
- A convex envelope formula for multilinear functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving long-term financial planning problems via global optimization
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A polyhedral branch-and-cut approach to global optimization
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Finding all solutions of nonlinearly constrained systems of equations
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- 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
- On convex relaxations for quadratically constrained quadratic programming
- Decomposition strategy for the stochastic pooling problem
- Analyzing the computational impact of MIQCP solver components
- Explicit convex and concave envelopes through polyhedral subdivisions
- Portfolio optimization for wealth-dependent risk preferences
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A fully general, exact algorithm for nesting irregular shapes
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- The MILP Road to MIQCP
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Extending a CIP Framework to Solve MIQCPs
- A Polytope for a Product of Real Linear Functions in 0/1 Variables
- Pooling Problem: Alternate Formulations and Solution Methods
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Global Optimization of the Scenario Generation and Portfolio Selection Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex Relaxations of (0, 1)-Quadratic Programming
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Benchmarking optimization software with performance profiles.
