A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming

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. The positive semidefinite penalty (PSDP) method originated from research on semidefi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications Vol. 208; no. 1; p. 53
Main Authors: Huo, Xinyue, Gu, Ran
Format: Journal Article
Language:English
Published: New York Springer US 01.01.2026
Springer Nature B.V
Subjects:
Accuracy
Algorithms
Applications of Mathematics
Branch & bound algorithms
Calculus of Variations and Optimal Control; Optimization
Circuit design
Combinatorial analysis
Design optimization
Efficiency
Engineering
Integer programming
Mathematical programming
Mathematics
Mathematics and Statistics
Methods
Operations Research/Decision Theory
Optimization
Penalty function
Problem solving
Quadratic programming
Relaxation method (mathematics)
Theory of Computation
Variables
90C20
Positive semidefinite penalty function
65K05
Projection alternating BB stepsize
Binary quadratic programming
Proximal point algorithm
90C09
ISSN:0022-3239, 1573-2878
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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. The positive semidefinite penalty (PSDP) method originated from research on semidefinite relaxation, where the introduction of an exact penalty function improves the efficiency and accuracy of problem solving. In this paper, we propose a vectorized PSDP method for solving the UBQP problem, which optimizes computational efficiency by vectorizing matrix variables within a PSDP framework. Algorithmic enhancements in penalty updating and initialization are implemented, along with the introduction of two algorithms that integrate the proximal point algorithm and the projection alternating BB method for subproblem resolution. Properties of the penalty function and algorithm convergence are analyzed. Numerical experiments show the superior performance of the method in providing high-quality solutions and satisfactory solution times compared to the semidefinite relaxation method and other established methods.
AbstractList 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. The positive semidefinite penalty (PSDP) method originated from research on semidefinite relaxation, where the introduction of an exact penalty function improves the efficiency and accuracy of problem solving. In this paper, we propose a vectorized PSDP method for solving the UBQP problem, which optimizes computational efficiency by vectorizing matrix variables within a PSDP framework. Algorithmic enhancements in penalty updating and initialization are implemented, along with the introduction of two algorithms that integrate the proximal point algorithm and the projection alternating BB method for subproblem resolution. Properties of the penalty function and algorithm convergence are analyzed. Numerical experiments show the superior performance of the method in providing high-quality solutions and satisfactory solution times compared to the semidefinite relaxation method and other established methods.
ArticleNumber 53
Author Gu, Ran
Huo, Xinyue
Author_xml – sequence: 1
  givenname: Xinyue
  surname: Huo
  fullname: Huo, Xinyue
  organization: NITFID, School of Statistics and Data Sciences, LPMC, KLMDASR and LEBPS, Nankai University
– sequence: 2
  givenname: Ran
  orcidid: 0000-0002-4416-5021
  surname: Gu
  fullname: Gu, Ran
  email: rgu@nankai.edu.cn
  organization: NITFID, School of Statistics and Data Sciences, LPMC, KLMDASR and LEBPS, Nankai University
BookMark eNp9kEtLQzEQhYNUsK3-AVcB11fzuI_cZS2-oGJF6zamN5Oa0iY1SYX6641WcOdimFmcc-bwDVDPeQcInVJyTglpLiIlbdUUhFV5hOAFO0B9WjX5EI3ooT4hjBWc8fYIDWJcEkJa0ZR99DrCL9AlH-wnaDz10Sb7AfgJ1laDsc4mwFNwapV2-B7Sm9fY-IBnrvMupqCsy7ZL61TY4cet0kEl2-Fp8Iug1mvrFsfo0KhVhJPfPUSz66vn8W0xebi5G48mRccalopO18R0es47VhPByhrqSkBVasNVy6HWpZoLwwQjJZQG9Jy2tBWmMazkuuGcD9HZPncT_PsWYpJLvw25eJQ8fyCU8rrMKrZXdcHHGMDITbDrXF5SIr9Jyj1JmUnKH5KSZRPfm2IWuwWEv-h_XF8etnk8
Cites_doi 10.1007/s10898-022-01268-3
10.1007/bf01587084
10.4236/jamp.2018.68147
10.1007/bf02115753
10.1109/itsc.2001.948654
10.1007/s10878-019-00517-8
10.1007/978-0-387-40065-5_17
10.1007/s10107-002-0347-5
10.1007/s00211-004-0569-y
10.1007/s40305-023-00468-2
10.1609/aaai.v31i1.10795
10.1016/0377-2217(84)90055-9
10.1007/978-1-4615-4381-7_13
10.1007/s10287-014-0210-1
10.1023/a:1017912624016
10.1016/j.engappai.2012.09.001
10.1007/s10479-006-0107-7
10.1145/3005345
10.1109/msp.2010.936019
10.1109/CEC.2017.7969360
10.1137/S1052623498336930
10.1007/s11590-008-0105-6
10.1287/moor.20.3.550
10.1007/s10732-007-9009-3
10.1093/imanum/draa031
10.1007/bf02247879
10.1023/A:1008282830093
10.1007/s10957-018-1416-0
10.1007/s10107-005-0637-9
10.1137/23M1561464
10.1016/j.cie.2010.05.015
10.1007/s10898-022-01144-0
10.1016/0167-6377(92)90043-3
10.1038/s41598-022-06070-5
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DOI 10.1007/s10957-025-02883-2
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Civil Engineering Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1573-2878
ExternalDocumentID 10_1007_s10957_025_02883_2
GrantInformation_xml – fundername: Fundamental Research Funds for the Central Universities
  grantid: 63253105
  funderid: http://dx.doi.org/10.13039/501100012226
– fundername: National Key Research and Development Program of China
  grantid: 2022YFA1003800
– fundername: National Natural Science Foundation of China
  grantid: 12201318
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
203
29L
2J2
2JN
2JY
2KG
2KM
2LR
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
78A
7WY
8FL
8TC
8UJ
95-
95.
95~
96X
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABWNU
ABXPI
ACAOD
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADHHG
ADHIR
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BAPOH
BENPR
BSONS
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FNLPD
FRRFC
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6~
KDC
KOV
LAK
LLZTM
MA-
N9A
NB0
NPVJJ
NQJWS
O93
O9G
O9I
O9J
OAM
P19
P2P
P9R
PF0
PT4
PT5
QOK
QOS
R89
R9I
RHV
RNS
ROL
RPX
RSV
S16
S1Z
S27
S3B
SAP
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TN5
TSG
TSK
TSV
TUC
TWZ
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
YLTOR
YQT
Z45
ZMTXR
~EX
-Y2
1SB
2.D
28-
2P1
2VQ
5QI
88I
8AO
8FE
8FG
8G5
AAAVM
AARHV
AAYTO
AAYXX
ABDPE
ABJCF
ABQSL
ABULA
ABUWG
ACBXY
ADHKG
ADXHL
AEBTG
AEFIE
AEKMD
AFEXP
AFFHD
AFGCZ
AFKRA
AGGDS
AGQPQ
AI.
AJBLW
AMVHM
ARAPS
ARCSS
AZQEC
BBWZM
BDATZ
BEZIV
BGLVJ
BGNMA
BPHCQ
CAG
CCPQU
CITATION
COF
DWQXO
EDO
EJD
FINBP
FRNLG
FSGXE
GNUQQ
GROUPED_ABI_INFORM_RESEARCH
GUQSH
H13
HCIFZ
H~9
I-F
K6V
K7-
KOW
L6V
M0C
M2O
M2P
M4Y
M7S
N2Q
NDZJH
NU0
OVD
P62
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
Q2X
R4E
RNI
RZC
RZE
RZK
S26
S28
SCLPG
T16
TEORI
TUS
VH1
VOH
ZCG
ZWQNP
ZY4
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-c272t-cd60fcdb3c2608246e658e54df3a93e6d4ab8f28204e4fedb19198f7f243d7333
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001614694800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0022-3239
IngestDate Sun Nov 16 04:02:43 EST 2025
Thu Nov 20 00:49:14 EST 2025
Sat Nov 15 01:10:56 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords 90C20
Positive semidefinite penalty function
65K05
Projection alternating BB stepsize
Binary quadratic programming
Proximal point algorithm
90C09
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c272t-cd60fcdb3c2608246e658e54df3a93e6d4ab8f28204e4fedb19198f7f243d7333
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-4416-5021
PQID 3272011364
PQPubID 48247
ParticipantIDs proquest_journals_3272011364
crossref_primary_10_1007_s10957_025_02883_2
springer_journals_10_1007_s10957_025_02883_2
PublicationCentury 2000
PublicationDate 2026-01-01
PublicationDateYYYYMMDD 2026-01-01
PublicationDate_xml – month: 01
  year: 2026
  text: 2026-01-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Journal of optimization theory and applications
PublicationTitleAbbrev J Optim Theory Appl
PublicationYear 2026
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References YH Dai (2883_CR9) 2005; 100
Y Xia (2883_CR35) 2009; 3
2883_CR8
PM Pardalos (2883_CR25) 1992; 11
2883_CR19
2883_CR16
2883_CR14
2883_CR36
RK Nayak (2883_CR21) 2020; 39
T Tang (2883_CR31) 2024; 34
A Beck (2883_CR3) 2000; 11
2883_CR13
WH Lin (2883_CR15) 2004; 5
RH Tütüncü (2883_CR33) 2003; 95
E Boros (2883_CR6) 1991; 33
E Boros (2883_CR7) 2007; 13
2883_CR11
PM Pardalos (2883_CR26) 1990; 45
2883_CR30
RF Teixeira (2883_CR32) 2010; 59
T Fujie (2883_CR10) 1997; 10
V Gulati (2883_CR12) 1984; 15
U Benlic (2883_CR4) 2013; 26
P Merz (2883_CR20) 2002; 8
F Barahona (2883_CR2) 1989; 44
Y Wang (2883_CR34) 2012
Z Liu (2883_CR17) 2018; 06
H Oshiyama (2883_CR24) 2022; 12
G Azuma (2883_CR1) 2023; 86
2883_CR27
2883_CR28
2883_CR23
2883_CR22
A Billionnet (2883_CR5) 2007; 109
HD Sherali (2883_CR29) 2007; 149
H Luo (2883_CR18) 2019; 180
References_xml – volume: 86
  start-page: 671
  issue: 3
  year: 2023
  ident: 2883_CR1
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-022-01268-3
– volume: 44
  start-page: 127
  issue: 1
  year: 1989
  ident: 2883_CR2
  publication-title: Math. Program.
  doi: 10.1007/bf01587084
– volume: 06
  start-page: 1720
  year: 2018
  ident: 2883_CR17
  publication-title: J. Appl. Math. Phys.
  doi: 10.4236/jamp.2018.68147
– volume: 33
  start-page: 151
  issue: 3
  year: 1991
  ident: 2883_CR6
  publication-title: Ann. Oper. Res.
  doi: 10.1007/bf02115753
– volume: 5
  start-page: 238
  issue: 4
  year: 2004
  ident: 2883_CR15
  publication-title: IEEE Trans. Intell. Transp. Syst.
  doi: 10.1109/itsc.2001.948654
– volume: 39
  start-page: 792
  issue: 3
  year: 2020
  ident: 2883_CR21
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-019-00517-8
– ident: 2883_CR23
  doi: 10.1007/978-0-387-40065-5_17
– volume: 95
  start-page: 189
  issue: 2
  year: 2003
  ident: 2883_CR33
  publication-title: Math. Program.
  doi: 10.1007/s10107-002-0347-5
– start-page: 395
  volume-title: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimziation Problems
  year: 2012
  ident: 2883_CR34
– volume: 100
  start-page: 21
  issue: 1
  year: 2005
  ident: 2883_CR9
  publication-title: Numer. Math.
  doi: 10.1007/s00211-004-0569-y
– ident: 2883_CR14
  doi: 10.1007/s40305-023-00468-2
– ident: 2883_CR36
  doi: 10.1609/aaai.v31i1.10795
– volume: 15
  start-page: 121
  issue: 1
  year: 1984
  ident: 2883_CR12
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(84)90055-9
– ident: 2883_CR22
  doi: 10.1007/978-1-4615-4381-7_13
– ident: 2883_CR8
  doi: 10.1007/s10287-014-0210-1
– volume: 8
  start-page: 197
  issue: 2
  year: 2002
  ident: 2883_CR20
  publication-title: J. Heuristics
  doi: 10.1023/a:1017912624016
– volume: 26
  start-page: 1162
  issue: 3
  year: 2013
  ident: 2883_CR4
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2012.09.001
– volume: 149
  start-page: 185
  year: 2007
  ident: 2883_CR29
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-006-0107-7
– ident: 2883_CR13
  doi: 10.1145/3005345
– ident: 2883_CR19
  doi: 10.1109/msp.2010.936019
– ident: 2883_CR28
– ident: 2883_CR30
  doi: 10.1109/CEC.2017.7969360
– volume: 11
  start-page: 179
  issue: 1
  year: 2000
  ident: 2883_CR3
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623498336930
– volume: 3
  start-page: 253
  year: 2009
  ident: 2883_CR35
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-008-0105-6
– ident: 2883_CR27
  doi: 10.1287/moor.20.3.550
– volume: 13
  start-page: 99
  issue: 2
  year: 2007
  ident: 2883_CR7
  publication-title: J. Heuristics
  doi: 10.1007/s10732-007-9009-3
– ident: 2883_CR11
  doi: 10.1093/imanum/draa031
– volume: 45
  start-page: 131
  year: 1990
  ident: 2883_CR26
  publication-title: Computing
  doi: 10.1007/bf02247879
– volume: 10
  start-page: 367
  year: 1997
  ident: 2883_CR10
  publication-title: J. Global Optim.
  doi: 10.1023/A:1008282830093
– volume: 180
  start-page: 964
  year: 2019
  ident: 2883_CR18
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-018-1416-0
– volume: 109
  start-page: 55
  year: 2007
  ident: 2883_CR5
  publication-title: Math. Program.
  doi: 10.1007/s10107-005-0637-9
– volume: 34
  start-page: 2169
  issue: 3
  year: 2024
  ident: 2883_CR31
  publication-title: SIAM J. Optim.
  doi: 10.1137/23M1561464
– volume: 59
  start-page: 425
  issue: 3
  year: 2010
  ident: 2883_CR32
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2010.05.015
– ident: 2883_CR16
  doi: 10.1007/s10898-022-01144-0
– volume: 11
  start-page: 119
  issue: 2
  year: 1992
  ident: 2883_CR25
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(92)90043-3
– volume: 12
  start-page: 2146
  issue: 1
  year: 2022
  ident: 2883_CR24
  publication-title: Sci. Rep.
  doi: 10.1038/s41598-022-06070-5
SSID ssj0009874
Score 2.439723
Snippet The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 53
SubjectTerms Accuracy
Algorithms
Applications of Mathematics
Branch & bound algorithms
Calculus of Variations and Optimal Control; Optimization
Circuit design
Combinatorial analysis
Design optimization
Efficiency
Engineering
Integer programming
Mathematical programming
Mathematics
Mathematics and Statistics
Methods
Operations Research/Decision Theory
Optimization
Penalty function
Problem solving
Quadratic programming
Relaxation method (mathematics)
Theory of Computation
Variables
Title A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
URI https://link.springer.com/article/10.1007/s10957-025-02883-2
https://www.proquest.com/docview/3272011364
Volume 208
WOSCitedRecordID wos001614694800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-2878
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009874
  issn: 0022-3239
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZQYYCBN6JQkAc2sNTaeXksiIqBVoHSqltI7LPUoQX1JcGv5-wktCAYYIziXKLzxf7O9n0fIRcqNUopL2DScGMTFJ9l0PCZDAyGMyBmMI4y_z7sdKLBQMZFUdi0PO1ebkm6kXql2E36IbPW6lYil-HAu47TXWQFGx67_SXVblRyL3MmuJBFqczPNr5OR0uM-W1b1M02rZ3_fecu2S7QJW3m4bBH1mC8T7ZWOAfxqv1J1Do9IM9N2nfr9sN30DR2J7gWQLswGmowQwtIaQxoc_ZG205smiLKpb2xsrjSykvgY9euppc-zFNt40nROD_0NcIXHpJe6_bp5o4VogtM8ZDPmNJB3SidCYWZTsS9ABCjgO9pI1IpINBemkUGE7W6B54BnWHCJyMTGu4JHQohjkhl_DKGY0KdsHXDz8JUYuMglKmpg5-aRqABhw2oksvS98lrzq2RLFmUrRcT9GLivJjwKqmV3ZMU_9k0EXYb2crSeFVyVXbH8vbv1k7-1vyUbHLMVvO1lxqpzCZzOCMbajEbTifnLv4-ACvV1U4
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDI4QIAEH3ojxzIEbRNqS9JEjICYQ2zTYmHYrbeJIOzAQe0jw63Gylg0EBzhWTd3Kce3PSfyZkBOdWq21DJmy3LoEJWAZVAKmQovmDIgZrKfMr0WNRtztqmZeFDYoTrsXW5LeU88Uu6kgYk5a2bXIZeh4FyRGLMeYf9_qTKl244J7mTPBhcpLZX6W8TUcTTHmt21RH22qa__7znWymqNLej4xhw0yB_1NsjLDOYhX9U-i1sEWeTynHb9u33sHQ5v-BNcYaAueegZszwFS2gSUOXyjdd9smiLKpQ997XClay-Bj134ml56N0qNsydNm5NDX0_4wm3yUL1qX16zvOkC0zziQ6ZNWLbaZEJjphNzGQJiFAiksSJVAkIj0yy2mKiVJUgLJsOET8U2slwKEwkhdsh8_7kPu4T6xtaVIItShYPDSKW2DEFqK6EBdBtQIqeF7pOXCbdGMmVRdlpMUIuJ12LCS-SgmJ4k_88GiXDbyK4tjSyRs2I6prd_l7b3t-HHZOm6Xa8ltZvG7T5Z5pi5TtZhDsj88HUEh2RRj4e9weuRt8UPNPjYMg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI4QIAQH3ojBgBy4QcSWpI8cx2MCsU1FwLRbaRNH2mEFsW4S_HqSdGUDwQFxrJq6Vewmn2P7M0LHMtFSSu4Toam2DopHUqh7RPjamDMYzKAdZX4r6HTCXk9EM1X8Ltu9DEkWNQ2WpSnLz16UPpspfBNeQKzkmm2XS8wivMBtIr311--7U9rdsORhpoRRJiZlMz_L-Lo1TfHmtxCp23maa___5nW0OkGduFGYyQaag2wTrcxwEZqr9ieB63ALPTVw153n999B4chldo0B38Ogr0D3LVDFERiZ-RtuuybU2KBf_JhJizdt2wnz2Lmr9cV3o0RZO5M4KpLBBuaF2-ixefVwcU0mzRiIpAHNiVR-TUuVMmk8oJByHwx2AY8rzRLBwFc8SUNtHLgaB65BpcYRFKEONOVMBYyxHTSfPWewi7BreF330iARZrAfiETXwEt03VdglhOooJNSD_FLwbkRT9mV7SzGZhZjN4sxraBqqap48v8NY2bDy7ZdDa-g01I109u_S9v72_AjtBRdNuPWTed2Hy1T49AWxzNVNJ-_juAALcpx3h--Hjqz_ACzguEW
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%3Ajournal&rft.genre=article&rft.atitle=A+Vectorized+Positive+Semidefinite+Penalty+Method+for+Unconstrained+Binary+Quadratic+Programming&rft.jtitle=Journal+of+optimization+theory+and+applications&rft.au=Huo%2C+Xinyue&rft.au=Gu%2C+Ran&rft.date=2026-01-01&rft.pub=Springer+US&rft.issn=0022-3239&rft.eissn=1573-2878&rft.volume=208&rft.issue=1&rft_id=info:doi/10.1007%2Fs10957-025-02883-2&rft.externalDocID=10_1007_s10957_025_02883_2
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-3239&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-3239&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-3239&client=summon