SONC Optimization and Exact Nonnegativity Certificates via Second-Order Cone Programming - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2023

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

Résumé

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 an 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.

Dates et versions

hal-03070864 , version 1 (16-12-2020)

Identifiants

Citer

Victor Magron, Jie Wang. SONC Optimization and Exact Nonnegativity Certificates via Second-Order Cone Programming. Journal of Symbolic Computation, 2023, 115, pp.346-370. ⟨10.1016/j.jsc.2022.08.002⟩. ⟨hal-03070864⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More