Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
From MaRDI portal
Publication:1925777
DOI10.1007/s10107-012-0555-6zbMath1257.90079OpenAlexW1971583973WikidataQ62015640 ScholiaQ62015640MaRDI QIDQ1925777
Ruth Misener, Christodoulos A. Floudas
Publication date: 19 December 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0555-6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Linear transformation based solution methods for non-convex mixed integer quadratic programs, Global solutions to a class of CEC benchmark constrained optimization problems, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Optimization and validation of pumping system design and operation for water supply in high-rise buildings, Non polyhedral convex envelopes for 1-convex functions, A MILP formulation for generalized geometric programming using piecewise-linear approximations, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, Tightening methods based on nontrivial bounds on bilinear terms, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, A computational study of global optimization solvers on two trust region subproblems, Piecewise polyhedral formulations for a multilinear term, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, SUSPECT: MINLP special structure detector for Pyomo, Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization, Maximum probability O-D matrix estimation in large-sized networks, A framework for globally optimizing mixed-integer signomial programs, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Global optimization on non-convex two-way interaction truncated linear multivariate adaptive regression splines using mixed integer quadratic programming, Outer-product-free sets for polynomial optimization and oracle-based cuts, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Using general triangle inequalities within quadratic convex reformulation method, Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Global solution of non-convex quadratically constrained quadratic programs, Global optimization algorithm for mixed integer quadratically constrained quadratic program, Three enhancements for optimization-based bound tightening, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A note on convex reformulation schemes for mixed integer quadratic programs, A geometric way to build strong mixed-integer programming formulations, Mixed Integer Linear Programming Formulation Techniques, Convex envelope of bivariate cubic functions over rectangular regions, Ten years of feasibility pump, and counting, Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on reduction of quadratic and bilinear programs with equality constraints
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A review of recent advances in global optimization
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Existence and sum decomposition of vertex polyhedral convex envelopes
- 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
- Reduction of indefinite quadratic programs to bilinear programs
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Handbook of test problems in local and global optimization
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Primal-relaxed dual global optimization approach
- Global minimization by reducing the duality gap
- A convex envelope formula for multilinear functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Models for representing piecewise linear cost functions
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Convex envelopes for edge-concave functions
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Branching rules revisited
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Finding all solutions of nonlinearly constrained systems of equations
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Selected papers presented at the conference on the state of the art in global optimization: computational methods and applications, Princeton, NJ, USA, April 28-30, 1995
- \(\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
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Pooling Problem: Alternate Formulations and Solution Methods
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- On Nonconvex Quadratic Programming with Box Constraints
- Jointly Constrained Biconvex Programming
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- LAPACK Users' Guide
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Benchmarking optimization software with performance profiles.
