User Manual for BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints
Naoki Ito (naoki_itomist.i.u-tokyo.ac.jp)
Abstract: BBCPOP proposed in  is a MATLAB implementation of a hierarchy of sparse doubly nonnegative (DNN) relaxations of a class of polynomial optimization (minimization) problems (POPs) with binary, box and complementarity constraints. Given a POP in the class and a relaxation order (or a hierarchy level), BBCPOP constructs a simple conic optimization problem (COP), which serves as a DNN relaxation of the POP, and then solves the COP by applying the bisection and projection (BP) method [6, 5]. The software package BBCPOP, this manual, and a test set of POPs are available at https://sites.google.com/site/bbcpop1/.
Keywords: Polynomial optimization problems, Doubly nonnegative relaxation, Bisection and projection method, Large-scale problems, MATLAB software package.
Category 1: Convex and Nonsmooth Optimization (Convex Optimization )
Category 2: Linear, Cone and Semidefinite Programming (Other )
Category 3: Global Optimization
Entry Submitted: 04/02/2018
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|