Parametric Lagrangian dual for the binary quadratic programming problem

Yong Xia; Wenxun Xing

doi:10.1007/s10898-014-0164-4

Parametric Lagrangian dual for the binary quadratic programming problem

Yong Xia^*
, Wenxun Xing

^*此作品的通讯作者

数学科学学院

Tsinghua University

科研成果: 期刊稿件 › 文章 › 同行评审

4 引用（Scopus）

摘要

Based on a difference between convex decomposition of the Lagrangian function, we propose and study a family of parametric Lagrangian dual for the binary quadratic program. Then we show they improve several lower bounds in recent literature.

源语言	英语
页（从-至）	221-233
页数	13
期刊	Journal of Global Optimization
卷	61
期	2
DOI	https://doi.org/10.1007/s10898-014-0164-4
出版状态	已出版 - 2月 2014

访问文件

10.1007/s10898-014-0164-4

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{11d6166cb0d041d39034ae605415c03d,

title = "Parametric Lagrangian dual for the binary quadratic programming problem",

abstract = "Based on a difference between convex decomposition of the Lagrangian function, we propose and study a family of parametric Lagrangian dual for the binary quadratic program. Then we show they improve several lower bounds in recent literature.",

keywords = "Binary quadratic program, D.C. decomposition, Lagrangian dual, Lower bound, Semidefinite programming",

author = "Yong Xia and Wenxun Xing",

note = "Publisher Copyright: {\textcopyright} 2014, Springer Science+Business Media New York.",

year = "2014",

month = feb,

doi = "10.1007/s10898-014-0164-4",

language = "英语",

volume = "61",

pages = "221--233",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - Parametric Lagrangian dual for the binary quadratic programming problem

AU - Xia, Yong

AU - Xing, Wenxun

PY - 2014/2

Y1 - 2014/2

N2 - Based on a difference between convex decomposition of the Lagrangian function, we propose and study a family of parametric Lagrangian dual for the binary quadratic program. Then we show they improve several lower bounds in recent literature.

AB - Based on a difference between convex decomposition of the Lagrangian function, we propose and study a family of parametric Lagrangian dual for the binary quadratic program. Then we show they improve several lower bounds in recent literature.

KW - Binary quadratic program

KW - D.C. decomposition

KW - Lagrangian dual

KW - Lower bound

KW - Semidefinite programming

UR - https://www.scopus.com/pages/publications/84922835635

U2 - 10.1007/s10898-014-0164-4

DO - 10.1007/s10898-014-0164-4

M3 - 文章

AN - SCOPUS:84922835635

SN - 0925-5001

VL - 61

SP - 221

EP - 233

JO - Journal of Global Optimization

JF - Journal of Global Optimization

IS - 2

ER -

Parametric Lagrangian dual for the binary quadratic programming problem

摘要

访问文件

其它文件与链接

指纹

引用此