Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613)

scientific article; zbMATH DE number 6766571

Language	Label	Description	Also known as
English	Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods	scientific article; zbMATH DE number 6766571

Statements

instance of

scholarly article

0 references

title

Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (English)

0 references

0 references

0 references

Springer Proceedings in Mathematics & Statistics

0 references

publication date

29 August 2017

0 references

zbMATH Keywords

semidefinite programming

0 references

mixed-integer quadratically constrained programs

0 references

convex relaxations

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-23699-5_3

0 references

cites work

SCIP: solving constraint integer programs

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

Algorithm 875

0 references

Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

0 references

Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

0 references

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

0 references

Extending the QCR method to general mixed-integer programs

0 references

Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

0 references

An algorithmic framework for convex mixed integer nonlinear programs

0 references

Optimizing a polyhedral-semidefinite relaxation of completely positive programs

0 references

Separation and relaxation for cones of quadratic forms

0 references

On Nonconvex Quadratic Programming with Box Constraints

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

The MILP Road to MIQCP

0 references

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

Second-Order-Cone Constraints for Extended Trust-Region Subproblems

0 references

Globally solving nonconvex quadratic programming problems via completely positive programming

0 references

Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone

0 references

Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations

0 references

Separating doubly nonnegative and completely positive matrices

0 references

Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming

0 references

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

0 references

On global optimization with indefinite quadratics

0 references

Partial Lagrangian relaxation for general quadratic programming

0 references

A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Q5613011

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster

0 references

Improved semidefinite bounding procedure for solving max-cut problems to optimality

0 references

A new separation algorithm for the Boolean quadric and cut polytopes

0 references

On the Shannon capacity of a graph

0 references

The spherical constraint in Boolean quadratic programs

0 references

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods

0 references

Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations

0 references

GLOMIQO: global mixed-integer quadratic optimizer

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

BARON: A general purpose global optimization software package

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

0 references

Dual quadratic estimates in polynomial and Boolean programming

0 references

SDP Relaxations for Some Combinatorial Optimization Problems

0 references

Factorization and cutting planes for completely positive matrices by copositive projection

0 references

On Cones of Nonnegative Quadratic Functions

0 references

Semidefinite optimization

0 references

Semidefinite Programming

0 references

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach

0 references

Identifiers

zbMATH Open document ID

1369.90117

0 references

DOI

10.1007/978-3-319-23699-5_3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5351613