  


Solving sparse polynomial optimization problems with chordal structure using the sparse, boundeddegree sumofsquares hierarchy
Ahmadreza Marandi(A.marandiuvt.nl) Abstract: The sparse bounded degree sumofsquares (sparseBSOS) hierarchy of Weisser, Lasserre and Toh [arXiv:1607.01151,2016] constructs a sequence of lower bounds for a sparse polynomial optimization problem. Under some assumptions, it is proven by the authors that the sequence converges to the optimal value. In this paper, we modify the hierarchy to deal with problems containing equality constraints directly, without eliminating or replacing them by two inequalities. We also evaluate the sparseBSOS hierarchy on a wellknown bilinear programming problem, called the pooling problem. Keywords: Polynomial optimization , Sparse sumofsquares hierarchy, Semidefinite programming, Pooling problem, Chordal sparsity structure Category 1: Global Optimization Category 2: Nonlinear Optimization (Quadratic Programming ) Category 3: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Download: [PDF] Entry Submitted: 03/05/2017 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  