Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
From MaRDI portal
Recommendations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
- Semidefinite approximation for mixed binary quadratically constrained quadratic programs
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- scientific article; zbMATH DE number 1380758
- Semidefinite programming relaxation for nonconvex quadratic programs
- Convex MIQP reformulations for semi-continuous quadratic programming with low price
- Semidefinite relaxation and nonconvex quadratic optimization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Cites work
- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A new separation algorithm for the Boolean quadric and cut polytopes
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A Spectral Bundle Method for Semidefinite Programming
- Algorithm 875
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximation of the stability number of a graph via copositive programming
- BARON: A general purpose global optimization software package
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Dual quadratic estimates in polynomial and Boolean programming
- Extending the QCR method to general mixed-integer programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On Cones of Nonnegative Quadratic Functions
- On global optimization with indefinite quadratics
- On nonconvex quadratic programming with box constraints
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the Shannon capacity of a graph
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Partial Lagrangian relaxation for general quadratic programming
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- SCIP: solving constraint integer programs
- SDP relaxations for some combinatorial optimization problems
- Second-order-cone constraints for extended trust-region subproblems
- Semidefinite optimization
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Subgradient based outer approximation for mixed integer second order cone programming
- Symmetric tensor approximation hierarchies for the completely positive cone
- The MILP road to MIQCP
- The spherical constraint in Boolean quadratic programs
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(4)
This page was built for publication: Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351613)
