Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
From MaRDI portal
Publication:5351613
DOI10.1007/978-3-319-23699-5_3zbMath1369.90117MaRDI QIDQ5351613
Publication date: 29 August 2017
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23699-5_3
90C22: Semidefinite programming
90C11: Mixed integer programming
90C26: Nonconvex programming, global optimization
Related Items
Cites Work
- Unnamed Item
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- GLOMIQO: global mixed-integer quadratic optimizer
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Extending the QCR method to general mixed-integer programs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- SCIP: solving constraint integer programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The spherical constraint in Boolean quadratic programs
- An algorithmic framework for convex mixed integer nonlinear programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Dual quadratic estimates in polynomial and Boolean programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On global optimization with indefinite quadratics
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- BARON: A general purpose global optimization software package
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- A new separation algorithm for the Boolean quadric and cut polytopes
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- Partial Lagrangian relaxation for general quadratic programming
- Approximation of the Stability Number of a Graph via Copositive Programming
- SDP Relaxations for Some Combinatorial Optimization Problems
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- The MILP Road to MIQCP
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Semidefinite optimization
- Algorithm 875
- On Nonconvex Quadratic Programming with Box Constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- On Cones of Nonnegative Quadratic Functions
