Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김선영 | * |
dc.date.accessioned | 2019-10-02T02:00:03Z | - |
dc.date.available | 2019-10-02T02:00:03Z | - |
dc.date.issued | 2019 | * |
dc.identifier.issn | 0098-3500 | * |
dc.identifier.issn | 1557-7295 | * |
dc.identifier.other | OAK-25367 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/251501 | - |
dc.description.abstract | The software package BBCPOP is a MATLAB implementation of a hierarchy of sparse doubly nonnegative relaxations of a class of polynomial optimization (minimization) problems (POPs) with binary, box, and complementarity (BBC) constraints. Given a POP in the class and a relaxation order, BBCPOP constructs a simple conic optimization problem (COP), which serves as a doubly nonnegative relaxation of the POP, and then solves the COP by applying the bisection and projection method. The COP is expressed with a linear objective function and constraints described as a single hyperplane and two cones, which are the Cartesian product of positive semidefinite cones and a polyhedral cone induced from the BBC constraints. BBCPOP aims to compute a tight lower bound for the optimal value of a large-scale POP in the class that is beyond the comfort zone of existing software packages. The robustness, reliability, and efficiency of BBCPOP are demonstrated in comparison to the state-of-the-art software SDP package SDPNAL+ on randomly generated sparse POPs of degree 2 and 3 with up to a few thousands variables, and ones of degree from 5 to 8 with up to a few hundred variables. Numerical results on BBC-constrained POPs that arise from quadratic assignment problems are also reported. The software package BBCPOP is available at https://sites.google.com/sit/bbcpop1/. | * |
dc.language | English | * |
dc.publisher | ASSOC COMPUTING MACHINERY | * |
dc.subject | MATLAB software package | * |
dc.subject | high-degree polynomial optimization problems with binary | * |
dc.subject | box and complementarity constraints | * |
dc.subject | hierarchy of doubly nonnegative relaxations | * |
dc.subject | sparsity | * |
dc.subject | bisection and projection methods | * |
dc.subject | tight lower bounds | * |
dc.subject | efficiency | * |
dc.title | Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints | * |
dc.type | Article | * |
dc.relation.issue | 3 | * |
dc.relation.volume | 45 | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.journaltitle | ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | * |
dc.identifier.doi | 10.1145/3309988 | * |
dc.identifier.wosid | WOS:000482177000010 | * |
dc.identifier.scopusid | 2-s2.0-85071177304 | * |
dc.author.google | Ito, Naoki | * |
dc.author.google | Kim, Sunyoung | * |
dc.author.google | Kojima, Masakazu | * |
dc.author.google | Takeda, Akiko | * |
dc.author.google | Toh, Kim-Chuan | * |
dc.contributor.scopusid | 김선영(57221275622) | * |
dc.date.modifydate | 20231116113048 | * |