Suchergebnisse - ((integer OR interier) OR internet) quadratic programming. semidefinite programming.

Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem von de Meijer, Frank, Siebenhofer, Melanie, Sotirov, Renata, Wiegele, Angelika

“… •The quadratic minimum spanning tree problem can be modelled as an integer SDP•Our new doubly nonnegative relaxation provides strong bounds for the QMSTP …”
Volltext

A semidefinite programming method for integer convex quadratic minimization von Park, Jaehyun, Boyd, Stephen

“… We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Z n …”
Volltext

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming von Huo, Xinyue, Gu, Ran

“… The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in combinatorial optimization, circuit design, and other fields …”
Volltext

On approximating complex quadratic optimization problems via semidefinite programming relaxations von So, Anthony Man-Cho, Zhang, Jiawei, Ye, Yinyu

“… In this paper the authors study semidefinite programming (SDP) models for a class of discrete and continuous quadratic optimization problems in the complex Hermitian form …”
Volltext

Semidefinite relaxations for non-convex quadratic mixed-integer programming von Buchheim, Christoph, Wiegele, Angelika

“… We present semidefinite relaxations for unconstrained non-convex quadratic mixed-integer optimization problems …”
Volltext

A computational study for bilevel quadratic programs using semidefinite relaxations von Adasme, Pablo, Lisser, Abdel

“… •We derive equivalent Mixed Integer Linear Programming formulations. Thus, we compute optimal solutions and upper bounds …”
Volltext

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems von Hijazi, Hassan, Coffrin, Carleton, Hentenryck, Pascal Van

“… This paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems …”
Volltext

Benders’ decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints von Paredes, M., Martins, L.S.A., Soares, S., Ye, Hongxing

“… Semidefinite programming relaxation of the rectangular AC optimal power flow is used in the subproblem …”
Volltext

Quadratic convex reformulation for quadratic programming with linear on–off constraints von Wu, Baiyi, Li, Duan, Jiang, Rujun

“… •Advance the state-of-the-art for quadratic programming with on–off constraints.•Generalize the quadratic convex reformulation approach …”
Volltext

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems von Billionnet, Alain, Elloumi, Sourour, Lambert, Amélie

“… We propose a solution approach for the general problem ( QP ) of minimizing a quadratic function of bounded integer variables subject to a set of quadratic constraints …”
Volltext

SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs von Nohra, Carlos J., Raghunathan, Arvind U., Sahinidis, Nikolaos V.

“… We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints …”
Volltext

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem von Billionnet, Alain, Elloumi, Sourour

“… Our main idea is to use the recent Mixed Integer Quadratic Programming (MIQP) solvers. But, for this, we have to first convexify the objective function q(x …”
Volltext

SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) von Sun, Defeng, Toh, Kim-Chuan, Yuan, Yancheng, Zhao, Xin-Yuan

“… Sdpnal+ is a MATLAB software package that implements an augmented Lagrangian based method to solve large scale semidefinite programming problems with bound constraints …”
Volltext

2×2-Convexifications for convex quadratic optimization with indicator variables von Han, Shaoning, Gómez, Andrés, Atamtürk, Alper

“… In this paper, we study the convex quadratic optimization problem with indicator variables. For the 2 …”
Volltext

Binary positive semidefinite matrices and associated integer polytopes von Letchford, Adam N., Sørensen, Michael M.

“… We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes …”
Volltext

The Chvátal–Gomory procedure for integer SDPs with applications in combinatorial optimization von de Meijer, Frank, Sotirov, Renata

“… In this paper we study the well-known Chvátal–Gomory (CG) procedure for the class of integer semidefinite programs (ISDPs …”
Volltext

An evaluation of semidefinite programming based approaches for discrete lot-sizing problems von Gicquel, C., Lisser, A., Minoux, M.

“… •This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation …”
Volltext

The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables von Han, Shaoning, Gómez, Andrés, Atamtürk, Alper

“… In this paper, we compare the strength of the optimal perspective relaxation and Shor's SDP relaxation for convex quadratic optimization problems with indicator …”
Volltext

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound von Burer, Samuel, Vandenbussche, Dieter

“… We consider a recent branch-and-bound algorithm of the authors for nonconvex quadratic programming …”
Volltext

Extending the QCR method to general mixed-integer programs von Billionnet, Alain, Elloumi, Sourour, Lambert, Amélie

“… Let ( MQP ) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints …”
Volltext