A fresh CP look at mixed-binary QPs: new formulations and relaxations
Triggered by Burer’s seminal characterization from 2009, many copositive reformulations of mixed-binary QPs have been discussed by now. Most of them can be used as proper relaxations, if the intractable co(mpletely)positive cones are replaced by tractable approximations. While the widely used approx...
Saved in:
Published in | Mathematical programming Vol. 166; no. 1-2; pp. 159 - 184 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.11.2017
Springer Nature B.V Springer Verlag |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Triggered by Burer’s seminal characterization from 2009, many copositive reformulations of mixed-binary QPs have been discussed by now. Most of them can be used as proper relaxations, if the intractable co(mpletely)positive cones are replaced by tractable approximations. While the widely used approximation hierarchies have the disadvantage to use positive-semidefinite (psd) matrices of orders which rapidly increase with the level of approximation, alternatives focus on the problem of keeping psd matrix orders small, with the aim to avoid memory problems in the interior point algorithms. This work continues this approach, proposing new reformulations and relaxations. Moreover, we provide a thorough comparison of the respective duals and establish a monotonicity relation among their duality gaps. We also identify sufficient conditions for strong duality/zero duality gap in some of these formulations and generalize some of our observations to general conic problems. |
---|---|
AbstractList | Triggered by Burer’s seminal characterization from 2009, many copositive reformulations of mixed-binary QPs have been discussed by now. Most of them can be used as proper relaxations, if the intractable co(mpletely)positive cones are replaced by tractable approximations. While the widely used approximation hierarchies have the disadvantage to use positive-semidefinite (psd) matrices of orders which rapidly increase with the level of approximation, alternatives focus on the problem of keeping psd matrix orders small, with the aim to avoid memory problems in the interior point algorithms. This work continues this approach, proposing new reformulations and relaxations. Moreover, we provide a thorough comparison of the respective duals and establish a monotonicity relation among their duality gaps. We also identify sufficient conditions for strong duality/zero duality gap in some of these formulations and generalize some of our observations to general conic problems. |
Author | Dickinson, Peter J. C. Cheng, Jianqiang Bomze, Immanuel M. Lisser, Abdel |
Author_xml | – sequence: 1 givenname: Immanuel M. surname: Bomze fullname: Bomze, Immanuel M. organization: Institut Für Statistik Und Operations Research (ISOR), Universität Wien – sequence: 2 givenname: Jianqiang surname: Cheng fullname: Cheng, Jianqiang organization: Department of Systems and Industrial Engineering, University of Arizona – sequence: 3 givenname: Peter J. C. surname: Dickinson fullname: Dickinson, Peter J. C. organization: Department of Applied Mathematics, University of Twente – sequence: 4 givenname: Abdel orcidid: 0000-0003-1318-6679 surname: Lisser fullname: Lisser, Abdel email: lisser@lri.fr organization: Laboratoire de Recherche En Informatique (LRI), Université Paris Sud - XI |
BackLink | https://hal.science/hal-01775995$$DView record in HAL |
BookMark | eNp1kEFLAzEQhYNUsK3-AG8BTx6iM012k_VWilqhYAU9h-xuYrduNzVptf57d1kRL56GGb73ePNGZND4xhJyjnCFAPI6IiBIBigZImRMHZEhCp4ykYp0QIYAk4QlKcIJGcW4BgDkSg3J7ZS6YOOKzpa09v6Nmh3dVAdbsrxqTPiiT8t4Qxv7SZ0Pm31tdpVvIjVNSYOtzaHfT8mxM3W0Zz9zTF7ubp9nc7Z4vH-YTResEEm2YyZXqBwUXDpnuCmNNJnMbcrLMuOFAkSp2vQTW-ZOZHkpCis48sIBFJDbhI_JZe-7MrXehmrTJtTeVHo-Xeju1v4vkyxLPrBlL3p2G_z73sadXvt9aNp4GrMEE4ESVEthTxXBxxis-7VF0F2zum-2c9Zds7rTTHpNbNnm1YY_zv-KvgGyO3uE |
CitedBy_id | crossref_primary_10_1007_s10107_019_01453_5 crossref_primary_10_1016_j_ejco_2021_100012 crossref_primary_10_1007_s10898_019_00863_1 crossref_primary_10_2139_ssrn_3270706 crossref_primary_10_1007_s10287_018_0337_6 crossref_primary_10_1016_j_ejco_2021_100021 crossref_primary_10_1137_19M1237715 crossref_primary_10_1007_s10898_020_00879_y crossref_primary_10_1287_ijoc_2019_0901 crossref_primary_10_1007_s10898_018_0676_4 crossref_primary_10_1007_s10898_021_01066_3 |
Cites_doi | 10.1137/1.9780898719574 10.1287/moor.1060.0242 10.1080/03081087.2013.869591 10.1142/5273 10.1137/0608037 10.1007/s10107-008-0223-z 10.1007/s11590-010-0174-1 10.1007/978-1-4615-4381-7_3 10.1007/978-1-4614-0769-0_8 10.1016/j.ejor.2011.04.026 10.1007/s10898-011-9749-3 10.1007/s10107-015-0888-z 10.1007/BF02592948 10.1007/s10589-013-9594-z 10.1007/978-3-642-12598-0_1 10.1023/A:1026583532263 10.1137/140987997 10.1137/140973207 10.1007/s12532-010-0010-8 10.1007/978-3-642-80730-5 |
ContentType | Journal Article |
Copyright | Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2017 Mathematical Programming is a copyright of Springer, 2017. Distributed under a Creative Commons Attribution 4.0 International License |
Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2017 – notice: Mathematical Programming is a copyright of Springer, 2017. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
DBID | AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PQBIZ PQBZA PQEST PQQKQ PQUKI PRINS PTHSS Q9U 1XC |
DOI | 10.1007/s10107-017-1109-8 |
DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection (ProQuest) ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Database (1962 - current) ProQuest Central Essentials AUTh Library subscriptions: ProQuest Central ProQuest Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection (Proquest) (PQ_SDU_P3) ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global (ProQuest) Computing Database ProQuest Science Journals ProQuest Engineering Database ProQuest Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection One Business (ProQuest) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic Hyper Article en Ligne (HAL) |
DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing Engineering Database ProQuest Science Journals (Alumni Edition) ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest One Academic ProQuest Central (Alumni) Business Premium Collection (Alumni) |
DatabaseTitleList | ABI/INFORM Global (Corporate) |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Mathematics Computer Science |
EISSN | 1436-4646 |
EndPage | 184 |
ExternalDocumentID | oai_HAL_hal_01775995v1 10_1007_s10107_017_1109_8 |
GrantInformation_xml | – fundername: FMJH Program Gaspard Monge in Optimization and Operation Research grantid: EDF. PGMO/IROE grant No. 2012-042H |
GroupedDBID | --K --Z -52 -5D -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1B1 1N0 1OL 1SB 203 28- 29M 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AABYN AAFGU AAHNG AAIAL AAJKR AANZL AAPBV AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABBBX ABBXA ABDBF ABDZT ABECU ABFGW ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKAS ABKCH ABKTR ABMNI ABMQK ABNWP ABPTK ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACBMV ACBRV ACBXY ACBYP ACGFS ACGOD ACHSB ACHXU ACIGE ACIPQ ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACTTH ACVWB ACWMK ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEEQQ AEFIE AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AENEX AEOHA AEPOP AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AFEXP AFFNX AFGCZ AFKRA AFLOW AFMKY AFNRJ AFQWF AFWTZ AFZKB AGAYW AGDGC AGGBP AGGDS AGJBK AGMZJ AGPAZ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AJZVZ AKQUC AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQ- NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9R PF0 PQBIZ PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RIG RNI RNS ROL RPX RPZ RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XPP YLTOR Z45 Z5O Z7R Z7S Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZL0 ZMTXR ZWQNP ~02 ~8M ~EX AACDK AAEOY AAJBT AASML AAYXX ABAKF ACAOD ACDTI ACZOJ AEARS AEFQL AEMSY AFBBN AGQEE AGRTI AIGIU CITATION H13 PQBZA 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PQEST PQUKI PRINS Q9U 1XC |
ID | FETCH-LOGICAL-c459t-ab818f0c37ffa3ada7a97be63dd93c8011781102edbf49bd4ce4313cf00c0be53 |
IEDL.DBID | BENPR |
ISSN | 0025-5610 |
IngestDate | Fri Sep 06 12:20:26 EDT 2024 Fri Sep 13 08:55:43 EDT 2024 Thu Sep 12 18:53:10 EDT 2024 Sat Dec 16 12:02:34 EST 2023 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1-2 |
Keywords | 90C20 Nonconvex optimization 90C30 Quadratic optimization Copositivity Completely positive Reformulations Nonlinear optimization 90C26 Conic optimization |
Language | English |
License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c459t-ab818f0c37ffa3ada7a97be63dd93c8011781102edbf49bd4ce4313cf00c0be53 |
ORCID | 0000-0003-1318-6679 0000-0002-6288-9226 |
OpenAccessLink | https://repository.arizona.edu/bitstream/10150/632069/1/CP_for_MIQP-2016-12-19.pdf |
PQID | 1951541708 |
PQPubID | 25307 |
PageCount | 26 |
ParticipantIDs | hal_primary_oai_HAL_hal_01775995v1 proquest_journals_1951541708 crossref_primary_10_1007_s10107_017_1109_8 springer_journals_10_1007_s10107_017_1109_8 |
PublicationCentury | 2000 |
PublicationDate | 2017-11-01 |
PublicationDateYYYYMMDD | 2017-11-01 |
PublicationDate_xml | – month: 11 year: 2017 text: 2017-11-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | Berlin/Heidelberg |
PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
PublicationSubtitle | A Publication of the Mathematical Optimization Society |
PublicationTitle | Mathematical programming |
PublicationTitleAbbrev | Math. Program |
PublicationYear | 2017 |
Publisher | Springer Berlin Heidelberg Springer Nature B.V Springer Verlag |
Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V – name: Springer Verlag |
References | CR2 Bomze, Dür, de Klerk, Roos, Quist, Terlaky (CR6) 2000; 18 Burer (CR13) 2015; 151 Berman, Shaked-Monderer (CR3) 2003 Bomze (CR5) 2015; 25 Shor (CR22) 1987; 222 Trefethen, Bau (CR23) 1997 Murty, Kabadi (CR18) 1987; 39 Bomze, Schachinger, Ullrich (CR8) 2015; 36 Shaked-Monderer, Berman, Bomze, Jarre, Schachinger (CR21) 2015; 63 Pataki, Wolkowicz, Saigal, Vandenberghe (CR19) 2000 Bomze (CR4) 2012; 216 Gilbert, Heath (CR17) 1987; 8 Burer (CR10) 2009; 120 CR14 Bomze, Schachinger, Uchida (CR9) 2012; 52 Arima, Kim, Kojima (CR1) 2014; 10 Bomze, Jarre (CR7) 2010; 4 Dickinson, Gijben (CR15) 2014; 57 Pataki (CR20) 2007; 32 Burer, Anjos, Lasserre (CR12) 2012 Dür, Diehl, Glineur, Jarlebring, Michiels (CR16) 2010 Burer (CR11) 2010; 2 S Burer (1109_CR12) 2012 IM Bomze (1109_CR4) 2012; 216 IM Bomze (1109_CR5) 2015; 25 IM Bomze (1109_CR7) 2010; 4 N Arima (1109_CR1) 2014; 10 N Shaked-Monderer (1109_CR21) 2015; 63 1109_CR2 LN Trefethen (1109_CR23) 1997 S Burer (1109_CR13) 2015; 151 S Burer (1109_CR11) 2010; 2 IM Bomze (1109_CR8) 2015; 36 KG Murty (1109_CR18) 1987; 39 A Berman (1109_CR3) 2003 1109_CR14 M Dür (1109_CR16) 2010 G Pataki (1109_CR20) 2007; 32 IM Bomze (1109_CR9) 2012; 52 S Burer (1109_CR10) 2009; 120 JR Gilbert (1109_CR17) 1987; 8 G Pataki (1109_CR19) 2000 IM Bomze (1109_CR6) 2000; 18 NZ Shor (1109_CR22) 1987; 222 PJC Dickinson (1109_CR15) 2014; 57 |
References_xml | – year: 1997 ident: CR23 publication-title: Numerical Linear Algebra doi: 10.1137/1.9780898719574 contributor: fullname: Bau – volume: 32 start-page: 395 issue: 2 year: 2007 end-page: 412 ident: CR20 article-title: On the closedness of the linear image of a closed convex cone publication-title: Math. Oper. Res. doi: 10.1287/moor.1060.0242 contributor: fullname: Pataki – volume: 63 start-page: 384 issue: 2 year: 2015 end-page: 396 ident: CR21 article-title: New results on the cp rank and related properties of co(mpletely )positive matrices publication-title: Linear Multilinear Algebra doi: 10.1080/03081087.2013.869591 contributor: fullname: Schachinger – volume: 10 start-page: 437 year: 2014 end-page: 451 ident: CR1 article-title: Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables publication-title: Pac. J. Optim. contributor: fullname: Kojima – volume: 222 start-page: 128 issue: 1 year: 1987 end-page: 139 ident: CR22 article-title: Quadratic optimization problems publication-title: Izv. Akad. Nauk SSSR Tekhn. Kibernet. contributor: fullname: Shor – ident: CR14 – ident: CR2 – year: 2003 ident: CR3 publication-title: Completely Positive Matrices doi: 10.1142/5273 contributor: fullname: Shaked-Monderer – volume: 8 start-page: 446 issue: 3 year: 1987 end-page: 459 ident: CR17 article-title: Computing a sparse basis for the null space publication-title: SIAM J. Algebraic Discrete Methods doi: 10.1137/0608037 contributor: fullname: Heath – volume: 120 start-page: 479 issue: 2 year: 2009 end-page: 495 ident: CR10 article-title: On the copositive representation of binary and continuous nonconvex quadratic programs publication-title: Math. Program. doi: 10.1007/s10107-008-0223-z contributor: fullname: Burer – volume: 4 start-page: 465 year: 2010 end-page: 472 ident: CR7 article-title: A note on Burers copositive representation of mixed-binary QPs publication-title: Optim. Lett. doi: 10.1007/s11590-010-0174-1 contributor: fullname: Jarre – start-page: 29 year: 2000 end-page: 65 ident: CR19 article-title: The geometry of semidefinite programming publication-title: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications doi: 10.1007/978-1-4615-4381-7_3 contributor: fullname: Vandenberghe – start-page: 201 year: 2012 end-page: 218 ident: CR12 article-title: Copositive programming publication-title: Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications. International Series in Operations Research and Management Science doi: 10.1007/978-1-4614-0769-0_8 contributor: fullname: Lasserre – volume: 216 start-page: 509 year: 2012 end-page: 520 ident: CR4 article-title: Copositive optimization—recent developments and applications publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.04.026 contributor: fullname: Bomze – volume: 52 start-page: 423 year: 2012 end-page: 445 ident: CR9 article-title: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization publication-title: J. Glob. Optim. doi: 10.1007/s10898-011-9749-3 contributor: fullname: Uchida – volume: 151 start-page: 89 year: 2015 end-page: 116 ident: CR13 article-title: A gentle, geometric introduction to copositive optimization publication-title: Math. Program. doi: 10.1007/s10107-015-0888-z contributor: fullname: Burer – volume: 39 start-page: 117 issue: 2 year: 1987 end-page: 129 ident: CR18 article-title: Some NP-complete problems in quadratic and nonlinear programming publication-title: Math. Program. doi: 10.1007/BF02592948 contributor: fullname: Kabadi – volume: 57 start-page: 403 issue: 2 year: 2014 end-page: 415 ident: CR15 article-title: On the computational complexity of membership problems for the completely positive cone and its dual publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-013-9594-z contributor: fullname: Gijben – start-page: 3 year: 2010 end-page: 20 ident: CR16 article-title: Copositive programming–a survey publication-title: Recent Advances in Optimization and its Applications in Engineering doi: 10.1007/978-3-642-12598-0_1 contributor: fullname: Michiels – volume: 18 start-page: 301 year: 2000 end-page: 320 ident: CR6 article-title: On copositive programming and standard quadratic optimization problems publication-title: J. Glob. Optim. doi: 10.1023/A:1026583532263 contributor: fullname: Terlaky – volume: 25 start-page: 1249 year: 2015 end-page: 1275 ident: CR5 article-title: Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained QPs publication-title: SIAM J. Optim. doi: 10.1137/140987997 contributor: fullname: Bomze – volume: 36 start-page: 20 issue: 1 year: 2015 end-page: 37 ident: CR8 article-title: New lower bounds and asymptotics for the cp-rank publication-title: SIAM J. Matrix Anal. Appl. doi: 10.1137/140973207 contributor: fullname: Ullrich – volume: 2 start-page: 1 issue: 1 year: 2010 end-page: 19 ident: CR11 article-title: Optimizing a polyhedral-semidefinite relaxation of completely positive programs publication-title: Math. Program. Comput. doi: 10.1007/s12532-010-0010-8 contributor: fullname: Burer – volume: 4 start-page: 465 year: 2010 ident: 1109_CR7 publication-title: Optim. Lett. doi: 10.1007/s11590-010-0174-1 contributor: fullname: IM Bomze – volume: 25 start-page: 1249 year: 2015 ident: 1109_CR5 publication-title: SIAM J. Optim. doi: 10.1137/140987997 contributor: fullname: IM Bomze – volume: 216 start-page: 509 year: 2012 ident: 1109_CR4 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2011.04.026 contributor: fullname: IM Bomze – volume: 36 start-page: 20 issue: 1 year: 2015 ident: 1109_CR8 publication-title: SIAM J. Matrix Anal. Appl. doi: 10.1137/140973207 contributor: fullname: IM Bomze – volume: 18 start-page: 301 year: 2000 ident: 1109_CR6 publication-title: J. Glob. Optim. doi: 10.1023/A:1026583532263 contributor: fullname: IM Bomze – start-page: 29 volume-title: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications year: 2000 ident: 1109_CR19 doi: 10.1007/978-1-4615-4381-7_3 contributor: fullname: G Pataki – ident: 1109_CR2 doi: 10.1007/978-3-642-80730-5 – start-page: 201 volume-title: Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications. International Series in Operations Research and Management Science year: 2012 ident: 1109_CR12 doi: 10.1007/978-1-4614-0769-0_8 contributor: fullname: S Burer – volume: 57 start-page: 403 issue: 2 year: 2014 ident: 1109_CR15 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-013-9594-z contributor: fullname: PJC Dickinson – volume: 52 start-page: 423 year: 2012 ident: 1109_CR9 publication-title: J. Glob. Optim. doi: 10.1007/s10898-011-9749-3 contributor: fullname: IM Bomze – volume: 8 start-page: 446 issue: 3 year: 1987 ident: 1109_CR17 publication-title: SIAM J. Algebraic Discrete Methods doi: 10.1137/0608037 contributor: fullname: JR Gilbert – volume: 39 start-page: 117 issue: 2 year: 1987 ident: 1109_CR18 publication-title: Math. Program. doi: 10.1007/BF02592948 contributor: fullname: KG Murty – volume: 32 start-page: 395 issue: 2 year: 2007 ident: 1109_CR20 publication-title: Math. Oper. Res. doi: 10.1287/moor.1060.0242 contributor: fullname: G Pataki – start-page: 3 volume-title: Recent Advances in Optimization and its Applications in Engineering year: 2010 ident: 1109_CR16 doi: 10.1007/978-3-642-12598-0_1 contributor: fullname: M Dür – volume-title: Numerical Linear Algebra year: 1997 ident: 1109_CR23 doi: 10.1137/1.9780898719574 contributor: fullname: LN Trefethen – ident: 1109_CR14 – volume: 10 start-page: 437 year: 2014 ident: 1109_CR1 publication-title: Pac. J. Optim. contributor: fullname: N Arima – volume: 2 start-page: 1 issue: 1 year: 2010 ident: 1109_CR11 publication-title: Math. Program. Comput. doi: 10.1007/s12532-010-0010-8 contributor: fullname: S Burer – volume: 120 start-page: 479 issue: 2 year: 2009 ident: 1109_CR10 publication-title: Math. Program. doi: 10.1007/s10107-008-0223-z contributor: fullname: S Burer – volume: 63 start-page: 384 issue: 2 year: 2015 ident: 1109_CR21 publication-title: Linear Multilinear Algebra doi: 10.1080/03081087.2013.869591 contributor: fullname: N Shaked-Monderer – volume-title: Completely Positive Matrices year: 2003 ident: 1109_CR3 doi: 10.1142/5273 contributor: fullname: A Berman – volume: 151 start-page: 89 year: 2015 ident: 1109_CR13 publication-title: Math. Program. doi: 10.1007/s10107-015-0888-z contributor: fullname: S Burer – volume: 222 start-page: 128 issue: 1 year: 1987 ident: 1109_CR22 publication-title: Izv. Akad. Nauk SSSR Tekhn. Kibernet. contributor: fullname: NZ Shor |
SSID | ssj0001388 |
Score | 2.3337805 |
Snippet | Triggered by Burer’s seminal characterization from 2009, many copositive reformulations of mixed-binary QPs have been discussed by now. Most of them can be... |
SourceID | hal proquest crossref springer |
SourceType | Open Access Repository Aggregation Database Publisher |
StartPage | 159 |
SubjectTerms | Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Computer Science Cones Formulations Full Length Paper Hierarchies Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Matrix methods Numerical Analysis Operations Research Optimization and Control Theoretical |
SummonAdditionalLinks | – databaseName: SpringerLINK - Czech Republic Consortium dbid: AGYKE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT4NAEN7UetGDb2O1mo3xpKEBFgp4I01r4yua2KSeyL5ITRVNoab6650pUOvr4BGYLLDfsvMtM_sNIUe2il3GLWH4jmSGwwALAX7YcIFuCKY5SqxgtsV1s9tzzvtuv0Ls2a-LZNgoI5LTiXpur5s1zZL0DBTJNPwFsuhiVeoqWQzP7i_as_nXYr5fFmpFdlDGMn9r5Is3WhhgLuQc0fwWG526nM5qvg0wnSoVYqbJsDHOREO-_9Rx_MfbrJGVgoHSMB8y66Sikw2yPKdLCEdXMzHXdJO0QxrDonxAWzf0ETg55Rl9ephohatqPnqjtzfpKQV6TpEAF-XAUsoTRXGnzCQ_3iK9Tvuu1TWK6guGdNwgM7gAXx6bknlxzBlX3OOBJ3STKRUw6aOWnA_PbmslYicQypEayAiTsWlKU2iXbZNq8pzoHUKZr6Qd--gtMZLKRVO4gSUwxOigAn6NHJcoRC-5yEb0KaeMPRVBT0XYUxEYHwJOMzuUx-6GlxGeAyMPBdRerRqplzBGxUeZRhawSdexPBPaOClhmbv81x13_2W9R5bsHFeAt06q2Wis94G4ZOKgGKkfLNffvA priority: 102 providerName: Springer Nature |
Title | A fresh CP look at mixed-binary QPs: new formulations and relaxations |
URI | https://link.springer.com/article/10.1007/s10107-017-1109-8 https://www.proquest.com/docview/1951541708/abstract/ https://hal.science/hal-01775995 |
Volume | 166 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT9swED9R-rI9THxsWvmoLLQnkNUkdhqHlymglgoG6qZVYk-RvyImjcJoQPDf765JSocEj3ZOiXJn-372nX8H8CVyRSx0aLiSVnAp0BYG_TCPEW4Y4TVRrFC2xUV_NJGnl_HlCoyauzCUVtmsifOF2t1YOiPvhQgFYhkmgeppQ6cAtux9vf3LqX4UxVnrYhotaEehpIBt-2hwMf6xWJVDoVRTvpUwQxPhrK7RhfMEzIQT_yZX__mo1hVlSC7BzxcR07kjGq7BhxpBsqwy-Tqs-OkGvF_iFcTW-YKMdbYJg4wVuKm-Ysdj9gcxNdMlu_796B3tivXdE_s-nh0yhNeMAGxdzmvG9NQxuunyWLU_wmQ4-Hk84nX1BG5lnJZcG_TFRWBFUhRaaKcTnSbG94VzqbCKuOAU_m7knSlkapy0HsGEsEUQ2MD4WHyC1enN1H8GJpSzUaHI21EkVJu-idPQUIhQEoN9B_YbfeW3FUlG_kyHTMrNUbk5KTdH4T3U6EKO6K1H2bec-lAoIQK0h7ADO43C83pSzfLnIdCBg8YIS49f--LW2y_bhndRZXscAjuwWt7d-11EGqXpQksNT7rQzk5-nQ269ZDC3kmU_QMVo8_s |
link.rule.ids | 230,315,786,790,891,12792,21416,27957,27958,33408,33779,41116,41558,42185,42627,43635,43840,52146,52269 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEF58HNSD-MT6XMSTsph0N83GixSxVm1FQcHbsq9QQdtqqui_d6ZJ2irocZMlITOTmW93Zr8h5KDq0ojr0DApLGeCgy4MxGEWAdww3GukWMFqi5ta80FcPUaPxYZbVpRVlj5x6Khdz-Ie-XEIUCASYRzI0_4rw65RmF0tWmhMk1nBIXTiSfHGxcgTh1zKsmUr4oQyq5kfnQuHRZcxQ85NJn_EpekOVkVOQM5fWdJh8GkskcUCNdJ6ruZlMuW7K2RhgksQRu0RAWu2Ss7rNIWFdIee3dJnwNFUD-jL06d3uBLWb1_07jY7oQCpKYLWooVXRnXXUTzd8pmP18hD4_z-rMmKjgnMiigZMG0g_qaB5XGaaq6djnUSG1_jziXcSuR_k_C5Ve9MKhLjhPUAILhNg8AGxkd8ncx0e12_QSiXzlZTiREOs5_a1EyUhAbTggJZ6yvksJSX6ufEGGpMgYzCVSBchcJVMHkfJDqah5TWzXpL4TWYFCPp2UdYIdulwFXxI2VqrPYKOSqVMHH7rzdu_v-wPTLXvG-3VOvy5nqLzFdzOwBz2CYzg7d3vwNIY2B2h-b0DfdMylY |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF60guhBfOKj6iKelGCSTZrEW6ktVatUsOBt2ScKGksTpf57Z5qkVtGDx02GDZmZZL5lZr4h5NjXNmTCk04cKOYEDGwhIQ47IcANyYxAihWstrhtdAfB1UP4UM45zapq9yolWfQ0IEtTmp8NtT2baXzzJiWTkYOMmU48TxYwMmJN18BvTn_FHovjamYrAoUqrfnbFt8C0_wjlkXOYM4fadJJ9OmskpUSNtJmYec1MmfSdbI8QyYIq5spA2u2QdpNauEk_UhbffoMQJqKnL48jY3Go7AYfdC7fnZOAVNTRK3lDK-MilRTbG8ZF-tNMui071tdpxyZ4KggTHJHSAjA1lUsslYwoUUkkkiaBtM6YSpGArgYXtc3WtogkTpQBhAEU9Z1lStNyLZILX1NzTahLNbKtzGGOEx_CtmQYeJJzAsGSFu_Q04qffFhwYzBvziQUbkclMtRuRyEj0CjUznktO42exyvgVCErGfv3g6pVwrn5ZeUcQ8gYBh4kQt7nFZGmLn91xN3_yV9SBb7Fx3eu7y93iNLfuEV4Bx1UstHb2YfgEcuDybO9Qlq6csa |
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+fresh+CP+look+at+mixed-binary+QPs%3A+new+formulations+and+relaxations&rft.jtitle=Mathematical+programming&rft.au=Bomze%2C+Immanuel+M&rft.au=Cheng%2C+Jianqiang&rft.au=Dickinson%2C+Peter+J%3B+C&rft.au=Lisser%2C+Abdel&rft.date=2017-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=166&rft.issue=1-2&rft.spage=159&rft_id=info:doi/10.1007%2Fs10107-017-1109-8 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon |