Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix

In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP). However, solving the BQP is proved to be NP-hard. Due to this reason, many...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 International Conference on Wireless Communications and Signal Processing s. 1 - 5
Hlavný autor: Shenshen Gu
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.10.2010
Predmet:
Polynomials
Programming
Quadratic programming
Signal processing
Signal processing algorithms
Symmetric matrices
ISBN:9781424475568, 1424475562
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP). However, solving the BQP is proved to be NP-hard. Due to this reason, many novel algorithms have been proposed in order to improve the efficiency to solve the BQP. In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed in. The basic algorithm is firstly reviewed and then this algorithm is modified to solve binary quadratic programming problems with Q being a tri-diagonal. Furthermore, by improving this algorithm, an algorithm is proposed to solve binary quadratic programming problems with Q being a five-diagonal matrix.
AbstractList In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP). However, solving the BQP is proved to be NP-hard. Due to this reason, many novel algorithms have been proposed in order to improve the efficiency to solve the BQP. In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed in. The basic algorithm is firstly reviewed and then this algorithm is modified to solve binary quadratic programming problems with Q being a tri-diagonal. Furthermore, by improving this algorithm, an algorithm is proposed to solve binary quadratic programming problems with Q being a five-diagonal matrix.
Author Shenshen Gu
Author_xml – sequence: 1
  surname: Shenshen Gu
  fullname: Shenshen Gu
  email: gushenshen@shu.edu.cn
  organization: Sch. of Mechatron. Eng. & Autom., Shanghai Univ., Shanghai, China
BookMark eNpVUMtOwzAQNAIkoOQDEBf_QIrt2El8RBUvqRJFVOJYrR07GMVxcUKhNz4dV1RC7GV3ZmdHmj1DR33oDUIXlEwpJfLqZfa8mDKSoCgLRqU8QJmsasoZ55UQgh7-w2V9grJheCOpuGCU16foexG6bR-8gw6Pzhs8hG4DqjMYujZEN776AY8BK9dD3OL3D2gijE7jdQxtBO9d3-7mdJGEn0mPn7AyOxbwGF3eOGhDn9xDxNZtzB_hIe2_ztGxhW4w2b5P0PL2Zjm7z-ePdw-z63nuJBlzDZaArGshdV3oUmnJIaVQhaZlQyslK1Io0dgKmDCWMqulqJiyVpVG8xKKCbr8tXXGmNU6Op_irPZvK34Af89l4Q
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/WCSP.2010.5632199
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781424475551
9781424475537
1424475554
1424475538
9781424475544
1424475546
EndPage 5
ExternalDocumentID 5632199
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-caf0a98859c83c6bc94a000b3c16d17b9703b5df7a25ef12fc9572bffb6ec46a3
IEDL.DBID RIE
ISBN 9781424475568
1424475562
IngestDate Wed Aug 27 02:49:46 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-caf0a98859c83c6bc94a000b3c16d17b9703b5df7a25ef12fc9572bffb6ec46a3
PageCount 5
ParticipantIDs ieee_primary_5632199
PublicationCentury 2000
PublicationDate 2010-Oct.
PublicationDateYYYYMMDD 2010-10-01
PublicationDate_xml – month: 10
  year: 2010
  text: 2010-Oct.
PublicationDecade 2010
PublicationTitle 2010 International Conference on Wireless Communications and Signal Processing
PublicationTitleAbbrev WCSP
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000452148
Score 1.4641168
Snippet In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Polynomials
Programming
Quadratic programming
Signal processing
Signal processing algorithms
Symmetric matrices
Title Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix
URI https://ieeexplore.ieee.org/document/5632199
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG6AePCkBozv9ODRlX32cSYSD8askSg30ukDSYDVZSF686fblgVi4sXb7hyazey003l83yB0rRNQAhQNUohsgCKZDgBiEkCoQm4oh8jTMbw80MdHNhzyvIFutlgYrbVvPtO37tHX8lUhly5V1s1IYjcYb6ImpWSN1drmUxw1uL3ab7BbNLOOfUPpVL-zuqoZhbz72nvO141d9aK_pqt459I_-N9nHaLODqWH863_OUINPW-j77yYfjmosZhiNzceW9taOXgUFtNxUU6qt9kCVwUGj8PFH0uhnA1IXDdqzexSuJ4ys8AuS4ufMGgnFbgqJ4G1p7G7veOixMYelTvBzLH9f3bQoH836N0H9ZSFYMLDKpDChIIzlnHJEklA8lRYbUIiI6IiCtweCZApQ0WcaRPFRvKMxmAMEC1TIpJj1JoXc32CcKhFBI5eXxBmoz4QNpSjJqFSSZIyTk9R2ylv9L7m0RjVejv7W3yO9n2l3jfOXaBWVS71JdqTq2qyKK_8z_8BDmqwOg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4QTfSkBoxve_Doyj7b7ZlIMCJZI1FupNNtkQRYXRaiN3-6bVkgJl687c6haSbTTufxfYPQtQwg5ZBSJwRPBygilg6ATxxwU5cpysCzdAwvHdrtxv0-SyroZo2FkVLa5jN5az5tLT_NxNykyhoRCfQBY1toOwpD312itdYZFUMOrh_3K_QWjbRrX5E6lf9xWdf0XNZ4bT4ny9auctlf81Wse2nt_29jB6i-wenhZO2BDlFFTmvoO8nGXwZszMfYTI7H2roWBiCF-XiY5aPibTLDRYbBInHxx5ynxgoELlu1JnopXM6ZmWGTp8VPGKSRclzkI0db1NC833GWY6Uvy41gYvj-P-uo17rrNdtOOWfBGTG3cARXLmdxHDERB4KAYCHX2oRAeCT1KDB9KUCUKsr9SCrPV4JF1AelgEgREh4coeo0m8pjhF3JPTAE-5zEOu4DroM5qgIqUkHCmNETVDPKG7wvmTQGpd5O_xZfod1277Ez6Nx3H87Qnq3b2za6c1Qt8rm8QDtiUYxm-aU1hB9mSLOB
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+International+Conference+on+Wireless+Communications+and+Signal+Processing&rft.atitle=Polynomial+time+solvable+algorithms+to+binary+quadratic+programming+problems+with+Q+being+a+tri-diagonal+or+five-diagonal+matrix&rft.au=Shenshen+Gu&rft.date=2010-10-01&rft.pub=IEEE&rft.isbn=9781424475568&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FWCSP.2010.5632199&rft.externalDocID=5632199
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424475568/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424475568/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424475568/sc.gif&client=summon&freeimage=true