Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
From MaRDI portal
Publication:2638381
DOI10.1007/s10107-010-0371-9zbMath1198.90330OpenAlexW2157030448MaRDI QIDQ2638381
Pierre Bonami, Jon Lee, Anureet Saxena
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0371-9
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A model for clustering data from heterogeneous dissimilarities, A computational study for bilevel quadratic programs using semidefinite relaxations, Generating cutting planes for the semidefinite relaxation of quadratic programs, Conic approximation to quadratic optimization with linear complementarity constraints, Intersection Disjunctions for Reverse Convex Sets, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Cutting Plane Generation through Sparse Principal Component Analysis, GLOMIQO: global mixed-integer quadratic optimizer, Global optimization of MIQCPs with dynamic piecewise relaxations, Semidefinite relaxations for non-convex quadratic mixed-integer programming, 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, Outer-product-free sets for polynomial optimization and oracle-based cuts, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Linear programing relaxations for a strategic pricing problem in electricity markets, An integer linear programming approach for bilinear integer programming, Unbounded convex sets for non-convex mixed-integer quadratic programming, On global optimization with indefinite quadratics, Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems, On linear programs with linear complementarity constraints, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, Strong-branching inequalities for convex mixed integer nonlinear programs, Optimal rank-sparsity decomposition, Valid inequalities for quadratic optimisation with domain constraints, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, The split closure of a strictly convex body, Extensions on ellipsoid bounds for quadratic integer programming, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Convexification of bilinear forms through non-symmetric lifting, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, On the Composition of Convex Envelopes for Quadrilinear Terms, On the separation of split inequalities for non-convex quadratic integer programming
Uses Software
Cites Work
- Unnamed Item
- Revival of the Gomory cuts in the 1990's
- Enhancing RLT relaxations via a new class of semidefinite cuts
- MIP reformulations of the probabilistic set covering problem
- Optimizing over the first Chvátal closure
- An algorithmic framework for convex mixed integer nonlinear programs
- Relaxations for probabilistically constrained programs with discrete random variables
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Laplacian eigenvalues and the maximum cut problem
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Sequential convexification in reverse convex and disjunctive programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- On a positive semidefinite relaxation of the cut polytope
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Optimizing over the split closure
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On the Facial Structure of the Set of Correlation Matrices
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
