SONC Optimization and Exact Nonnegativity Certificates via Second-Order Cone Programming

by   Victor Magron, et al.

The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a representation using SOCs, given that they have a strong expressive ability. In this paper, we prove constructively that the cone of sums of nonnegative circuits (SONC) admits a SOC representation. Based on this, we give a new algorithm for unconstrained polynomial optimization via SOC programming. We also provide a hybrid numeric-symbolic scheme which combines the numerical procedure with a rounding-projection algorithm to obtain exact nonnegativity certificates. Numerical experiments demonstrate the efficiency of our algorithm for polynomials with fairly large degree and number of variables.



There are no comments yet.


page 1

page 2

page 3

page 4


Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials

We provide two hybrid numeric-symbolic optimization algorithms, computin...

Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming

The problem of optimizing over the cone of nonnegative polynomials is a ...

DC Decomposition of Nonconvex Polynomials with Algebraic Techniques

We consider the problem of decomposing a multivariate polynomial as the ...

Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients

Certifying the positivity of trigonometric polynomials is of first impor...

Second-order semi-implicit projection methods for micromagnetics simulations

Micromagnetics simulations require accurate approximation of the magneti...

Improving Optimal Power Flow Relaxations Using 3-Cycle Second-Order Cone Constraints

This paper develops a novel second order cone relaxation of the semidefi...

On the Acceleration of L-BFGS with Second-Order Information and Stochastic Batches

This paper proposes a framework of L-BFGS based on the (approximate) sec...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.