Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an obstacle) with convex or nearly-convex basic semialgebraic sets, computation of Euclidean distances between two such sets, separation of two convex basic semalgebraic sets that overlap, and tight containment of the union of several basic semialgebraic sets with a single convex one. We use algebraic techniques from sum of squares optimization that reduce all these tasks to semidefinite programs of small size and present numerical experiments in realistic scenarios.

%B RSS 2017 %G eng %U https://arxiv.org/abs/1611.07369 %0 Journal Article %J Mathematical Programming - Series B %D 2017 %T DC Decomposition of Nonconvex Polynomials with Algebraic Techniques %A Amir Ali Ahmadi %A Georgina Hall %XWe consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) and find ones that speed up the convex-concave procedure (CCP). We prove, however, that optimizing over the entire set of dcds is NP-hard.

%B Mathematical Programming - Series B %G eng %U http://arxiv.org/abs/1510.01518 %0 Book Section %B Algebraic and Geometric Methods in Discrete Mathematics %D 2017 %T Sum of Squares Basis Pursuit with Linear and Second Order Cone Programming %A Amir Ali Ahmadi %A Georgina Hall %XWe devise a scheme for solving an iterative sequence of linear programs (LPs) or second order cone programs (SOCPs) to approximate the optimal value of semidefinite and sum of squares (SOS) programs. The first LP and SOCP-based bounds in the sequence come from the recent work of Ahmadi and Majumdar on diagonally dominant sum of squares (DSOS) and scaled diagonally dominant sum of squares (SDSOS) polynomials. We then iteratively improve on these bounds by pursuing better bases in which more relevant SOS polynomials admit a DSOS or SDSOS representation. Different interpretations of the procedure from primal and dual perspectives are given. While the approach is applicable to semidefinite relaxations of general polynomial programs, we apply it to two problems of discrete optimization: the maximum independent set problem and the partition problem. We further show that some completely trivial instances of the partition problem lead to strictly positive polynomials on the boundary of the sum of squares cone and hence make the SOS relaxation fail.

%B Algebraic and Geometric Methods in Discrete Mathematics %I Contemporary Mathematics %8 2016 %G eng %U http://arxiv.org/abs/1510.01597 %0 Journal Article %J Discrete Optimization %D 2016 %T Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation %A Amir Ali Ahmadi %A Sanjeeb Dash %A Georgina Hall %X

We develop algorithms for inner approximating the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and Majumdar, we describe an iterative process through which our approximation is improved at every step. This is done using ideas from column generation in large-scale linear and integer programming. We then apply these techniques to approximate the sum of squares cone in a nonconvex polynomial optimization setting, and the copositive cone for a discrete optimization problem.

The stochastic block model (SBM) with two communities, or equivalently the planted bisection model, is a popular model of random graph exhibiting a cluster behaviour. In the symmetric case, the graph has two equally sized clusters and vertices connect with probability p within clusters and q across clusters. In the past two decades, a large body of literature in statistics and computer science has focused on providing lower-bounds on the scaling of |p−q| to ensure exact recovery. In this paper, we identify a sharp threshold phenomenon for exact recovery: if α=pn/log(n) and β=qn/log(n) are constant (with α>β), recovering the communities with high probability is possible if (α+β)/2-√αβ>1 and impossible if (α+β)/2−√αβ<1. In particular, this improves the existing bounds. This also sets a new line of sight for efficient clustering algorithms. While maximum likelihood (ML) achieves the optimal threshold (by definition), it is in the worst-case NP-hard. This paper proposes an efficient algorithm based on a semidefinite programming relaxation of ML, which is proved to succeed in recovering the communities close to the threshold, while numerical experiments suggest it may achieve the threshold. An efficient algorithm which succeeds all the way down to the threshold is also obtained using a partial recovery algorithm combined with a local improvement procedure.

%B IEEE: Transactions on Information Theory %V 62 %G eng %U http://arxiv.org/abs/1405.3267 %N 1