Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
From MaRDI portal
Publication:652290
DOI10.1007/S10107-010-0340-3zbMATH Open1229.90144OpenAlexW4231143303MaRDI QIDQ652290FDOQ652290
Authors: Anureet Saxena, Pierre Bonami, Jon Lee 
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
Recommendations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations for mixed-integer nonlinear programs
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems
- scientific article; zbMATH DE number 3920195
- A note on convex reformulation schemes for mixed integer quadratic programs
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Convex quadratic mixed-integer problems with quadratic constraints
- On convex relaxations for quadratically constrained quadratic programming
Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Mixed integer programming (90C11)
Cites Work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- An algorithmic framework for convex mixed integer nonlinear programs
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On Polyhedral Approximations of the Second-Order Cone
- Disjunctive programming: Properties of the convex hull of feasible points
- A polyhedral study of nonconvex quadratic programs with box constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- \(NP\)-hardness of linear multiplicative programming and related problems
- Relaxations for probabilistically constrained programs with discrete random variables
- MIP reformulations of the probabilistic set covering problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Optimizing over the split closure
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Title not available (Why is that?)
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- The Homotopy Principle and Algorithms for Linear Programming
Cited In (57)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection
- A disjunctive cutting plane algorithm for bilinear programming
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Approximated perspective relaxations: a project and lift approach
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Conic approximation to quadratic optimization with linear complementarity constraints
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Convex relaxations for mixed-integer nonlinear programs
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- An integer linear programming approach for bilinear integer programming
- 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
- Partial Lasserre relaxation for sparse Max-Cut
- Global solution of non-convex quadratically constrained quadratic programs
- Disjunctive Cuts for Nonconvex MINLP
- An LPCC approach to nonconvex quadratic programs
- Optimal rank-sparsity decomposition
- On the Composition of Convex Envelopes for Quadrilinear Terms
- 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
- On global optimization with indefinite quadratics
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- Convexification of bilinear forms through non-symmetric lifting
- On linear programs with linear complementarity constraints
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Global optimization of MIQCPs with dynamic piecewise relaxations
- GLOMIQO: global mixed-integer quadratic optimizer
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Title not available (Why is that?)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Projected perspective reformulations with applications in design problems
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Compact mixed-integer programming formulations in quadratic optimization
- Linear programing relaxations for a strategic pricing problem in electricity markets
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- The MILP road to MIQCP
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Intersection Disjunctions for Reverse Convex Sets
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Extended formulations in mixed integer conic quadratic programming
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
Uses Software
This page was built for publication: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652290)
