Compact mixed-integer programming formulations in quadratic optimization
From MaRDI portal
Publication:2089884
DOI10.1007/s10898-022-01184-6zbMath1505.90093arXiv2011.08823OpenAlexW4282574688MaRDI QIDQ2089884
Robert Hildebrand, Benjamin Beach, Joey Huchette
Publication date: 24 October 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.08823
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (2)
An approximation algorithm for optimal piecewise linear interpolations of bounded variable products ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Extending the QCR method to general mixed-integer programs
- Quadratic programming with one negative eigenvalue is NP-hard
- Approximating separable nonlinear functions via mixed zero-one programs
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Globally solving nonconvex quadratic programming problems via completely positive programming
- \(\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
- Triangular function analysis
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- QPLIB: a library of quadratic programming instances
- Error bounds for approximations with deep ReLU networks
- A binarisation heuristic for non-convex quadratic programming with box constraints
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- The MILP Road to MIQCP
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Analysis of MILP Techniques for the Pooling Problem
- L’algebre de Boole et ses applications en recherche operationnelle
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- A Survey of Combinatorial Gray Codes
- Global solution of non-convex quadratically constrained quadratic programs
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Constructing Extended Formulations from Reflection Relations
- Integer Programming and Combinatorial Optimization
- JuMP: A Modeling Language for Mathematical Optimization
- Strong mixed-integer programming formulations for trained neural networks
- Polyhedral methods for piecewise-linear functions. I: The lambda method
This page was built for publication: Compact mixed-integer programming formulations in quadratic optimization