Algorithm 996

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/site/bbcpop1/.

[1]  Kim-Chuan Toh,et al.  LAGRANGIAN-CONIC RELAXATIONS, PART II: APPLICATIONS TO POLYNOMIAL OPTIMIZATION PROBLEMS , 2020 .

[2]  Ambros M. Gleixner,et al.  SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework , 2018, Optim. Methods Softw..

[3]  Kim-Chuan Toh,et al.  Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems , 2018, J. Glob. Optim..

[4]  Jean B. Lasserre,et al.  Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity , 2016, Mathematical Programming Computation.

[5]  Henry Wolkowicz,et al.  ADMM for the SDP relaxation of the QAP , 2015, Math. Program. Comput..

[6]  Gregory J. Reid,et al.  An SDP-based Method for the Real Radical Ideal Membership Test , 2017, 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

[7]  Kim-Chuan Toh,et al.  A robust Lagrangian-DNN method for a class of quadratic optimization problems , 2017, Comput. Optim. Appl..

[8]  Jean B. Lasserre,et al.  A bounded degree SOS hierarchy for polynomial optimization , 2015, EURO J. Comput. Optim..

[9]  Kim-Chuan Toh,et al.  A Unified Formulation and Fast Accelerated Proximal Gradient Method for Classification , 2017, J. Mach. Learn. Res..

[10]  Naonori Ueda,et al.  Averaged Collapsed Variational Bayes Inference , 2017, J. Mach. Learn. Res..

[11]  Renato D. C. Monteiro,et al.  An adaptive accelerated first-order method for convex optimization , 2016, Comput. Optim. Appl..

[12]  Kim-Chuan Toh,et al.  A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems , 2016, Math. Program..

[13]  Amir Ali Ahmadi,et al.  Some applications of polynomial optimization in operations research and real-time decision making , 2015, Optimization Letters.

[14]  Jakub Marecek,et al.  Optimal Power Flow as a Polynomial Optimization Problem , 2014, IEEE Transactions on Power Systems.

[15]  Kim-Chuan Toh,et al.  SDPNAL$$+$$+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints , 2014, Math. Program. Comput..

[16]  Emmanuel J. Candès,et al.  Adaptive Restart for Accelerated Gradient Schemes , 2012, Foundations of Computational Mathematics.

[17]  Ian A. Hiskens,et al.  Moment-based relaxation of the optimal power flow problem , 2013, 2014 Power Systems Computation Conference.

[18]  Kim-Chuan Toh,et al.  B-475 Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems , 2014 .

[19]  Patrick L. Combettes,et al.  Moreau’s decomposition in Banach spaces , 2011, Math. Program..

[20]  Greg Blekherman.  Sums of Squares In Optimization , 2012 .

[21]  Li Wang,et al.  Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization , 2009, SIAM J. Optim..

[22]  J. Lasserre,et al.  Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .

[23]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

[24]  Nikos D. Sidiropoulos,et al.  Convex Optimization-Based Beamforming , 2010, IEEE Signal Processing Magazine.

[25]  Panos M. Pardalos,et al.  Greedy approximations for minimum submodular cover with submodular cost , 2010, Comput. Optim. Appl..

[26]  Kim-Chuan Toh,et al.  A Newton-CG Augmented Lagrangian Method for Semidefinite Programming , 2010, SIAM J. Optim..

[27]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[28]  J. Lasserre.  Moments, Positive Polynomials And Their Applications , 2009 .

[29]  Franz Rendl,et al.  Copositive and semidefinite relaxations of the quadratic assignment problem , 2009, Discret. Optim..

[30]  Masakazu Muramatsu,et al.  B-414 User Manual for SparsePOP: a Sparse Semidefinite Programming Relax- ation of Polynomial Optimization Problems , 2009 .

[31]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[32]  Masakazu Muramatsu,et al.  SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems , 2005 .

[33]  Franz Rendl,et al.  A Copositive Programming Approach to Graph Partitioning , 2007, SIAM J. Optim..

[34]  Jean B. Lasserre,et al.  Convergent SDP-Relaxations in Polynomial Optimization with Sparsity , 2006, SIAM J. Optim..

[35]  Masakazu Muramatsu,et al.  Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[36]  Masakazu Muramatsu,et al.  User Manual for SparsePOP : a Sparse Semidefinite Programming Relaxation of P polynomial O ptimization P roblems , 2005 .

[37]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[38]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[39]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[40]  Didier Henrion,et al.  GloptiPoly: global optimization over polynomials with Matlab and SeDuMi , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[41]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[42]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[43]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[44]  Henry Wolkowicz,et al.  On Lagrangian Relaxation of Quadratic Matrix Constraints , 2000, SIAM J. Matrix Anal. Appl..

[45]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[46]  Franz Rendl,et al.  Semidefinite Programming Relaxations for the Quadratic Assignment Problem , 1998, J. Comb. Optim..

[47]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[48]  Masakazu Kojima,et al.  SDPA (SemiDefinite Programming Algorithm) User's Manual Version 6.2.0 , 1995 .

[49]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[50]  Y. Nesterov.  A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .