Parametric Lagrangian dual for the binary quadratic programming problem

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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 61; číslo 2; s. 221 - 233
Hlavní autoři: Xia, Yong, Xing, Wenxun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.02.2015
Springer
Springer Nature B.V
Témata:
Computer Science
Decomposition
Eigenvalues
Financial analysis
Laboratories
Lower bounds
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Program development software
Quadratic programming
Real Functions
Software development
Studies
China
90C20
Lower bound
90C10
Binary quadratic program
Semidefinite programming
D.C. decomposition
Lagrangian dual
90C09
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-014-0164-4