Výsledky vyhľadávania - Integer quadratic programming. Semidefinite programming

Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem Autor 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…”
Získať plný text

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

“…We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Z n…”
Získať plný text

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

“…We present semidefinite relaxations for unconstrained non-convex quadratic mixed-integer optimization problems…”
Získať plný text

A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling Autor Hugo José Lara, Abel Soares Siqueira, Jinyun Yuan

“… The quadratic programming formulations leads to semidefinite relaxations, which allows us to approximately solve the models…”
Získať plný text

On the gap between the quadratic integer programming problem and its semidefinite relaxation Autor Malik, U., Jaimoukha, I.M., Halikias, G.D., Gungah, S.K.

“…Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): [inline-graphic not available…”
Získať plný text

Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs Autor Zheng, Xiaojin, Sun, Xiaoling, Li, Duan, Cui, Xueting

“… ► We give an improved mixed integer quadratic programming reformulation. ► This new MIQP reformulation is more efficient than the standard MIQP reformulation…”
Získať plný text

A Semidefinite Programming Method for Integer Convex Quadratic Minimization Autor Park, Jaehyun, Boyd, Stephen

“…We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice \({\bf Z}^n…”
Získať plný text

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

“…•We derive equivalent Mixed Integer Linear Programming formulations. Thus, we compute optimal solutions and upper bounds…”
Získať plný text

A Transactive Retail Market Mechanism for Active Distribution Network Integrated With Large-Scale Distributed Energy Resources Autor Huang, Chunyi, Wang, Chengmin, Zhang, Mingzhi, Xie, Ning, Wang, Yong

“…The burgeoning integration of distributed energy resources (DER) poses new challenges for the economic and safe operation of the electricity system. The…”
Získať plný text

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming Autor 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…”
Získať plný text

On approximating complex quadratic optimization problems via semidefinite programming relaxations Autor 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…”
Získať plný text

A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming Autor Chang, Xiaokai, Liu, Sanyang, Zhao, Pengjun

“… integer quadratic programming and maximum cut problem. The dual of these three types of problems is a 3-block separable convex optimization problem with a coupling linear equation constraint…”
Získať plný text

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems Autor 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…”
Získať plný text

Benders’ decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints Autor 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…”
Získať plný text

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives Autor Guruswami, V., Sinop, A. K.

“…We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global lin- ear constraints…”
Získať plný text

Quadratic convex reformulation for quadratic programming with linear on–off constraints Autor 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…”
Získať plný text

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems Autor 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…”
Získať plný text

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

“…We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints…”
Získať plný text

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem Autor 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…”
Získať plný text

SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) Autor 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…”
Získať plný text