Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
From MaRDI portal
Publication:652290
DOI10.1007/s10107-010-0340-3zbMath1229.90144MaRDI QIDQ652290
Anureet Saxena, Jon Lee, Pierre Bonami
Publication date: 14 December 2011
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-0340-3
90C22: Semidefinite programming
90C11: Mixed integer programming
90C26: Nonconvex programming, global optimization
Related Items
A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Global solution of non-convex quadratically constrained quadratic programs, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Intersection Disjunctions for Reverse Convex Sets, On the Composition of Convex Envelopes for Quadrilinear Terms, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Partial Lasserre relaxation for sparse Max-Cut, A new global algorithm for factor-risk-constrained mean-variance portfolio selection, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A computational study for bilevel quadratic programs using semidefinite relaxations, Generating cutting planes for the semidefinite relaxation of quadratic programs, GLOMIQO: global mixed-integer quadratic optimizer, An LPCC approach to nonconvex quadratic programs, An integer linear programming approach for bilinear integer programming, On linear programs with linear complementarity constraints, Optimal rank-sparsity decomposition, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Extensions on ellipsoid bounds for quadratic integer programming, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Faster, but weaker, relaxations for quadratically constrained quadratic programs, A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Global optimization of MIQCPs with dynamic piecewise relaxations, On global optimization with indefinite quadratics, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Convexification of bilinear forms through non-symmetric lifting, Compact mixed-integer programming formulations in quadratic optimization, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Outer-product-free sets for polynomial optimization and oracle-based cuts, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, Conic approximation to quadratic optimization with linear complementarity constraints, 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, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Disjunctive Cuts for Nonconvex MINLP, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Linear programing relaxations for a strategic pricing problem in electricity markets, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
Uses Software
Cites Work
- Unnamed Item
- MIP reformulations of the probabilistic set covering problem
- 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
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- 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
- 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
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- The Homotopy Principle and Algorithms for Linear Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- On Polyhedral Approximations of the Second-Order Cone
