The S-cone and a primal-dual view on second-order representability

DOI10.1007/S13366-020-00512-9zbMATH Open1471.90111arXiv2003.09495OpenAlexW3041133009MaRDI QIDQ2022366FDOQ2022366

Authors: Helen Naumann, Thorsten Theobald 

Publication date: 29 April 2021

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Abstract: The $mathcalS$-cone provides a common framework for cones of polynomials or exponential sums which establish non-negativity upon the arithmetic-geometric inequality, in particular for sums of non-negative circuit polynomials (SONC) or sums of arithmetic-geometric exponentials (SAGE). In this paper, we study the $mathcalS$-cone and its dual from the viewpoint of second-order representability. Extending results of Averkov and of Wang and Magron on the primal SONC cone, we provide explicit generalized second-order descriptions for rational $mathcalS$-cones and theirs duals.

Full work available at URL: https://arxiv.org/abs/2003.09495

Recommendations

• On representing the positive semidefinite cone using the second-order cone
• On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
• Notes on Duality in Second Order and p -Order Cone Optimization
• scientific article; zbMATH DE number 3889290
• Second order cones for maximal monotone operators via representative functions
• A note on treating a second order cone program as a special case of a semidefinite program
• Second-Order Cone Representation for Convex Sets in the Plane
• The primal-dual second-order cone approximations algorithm for symmetric cone programming
• Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
• On polyhedral and second-order cone decompositions of semidefinite optimization problems

zbMATH Keywords

second-order conedual conepositive polynomials\(\mathcal{S}\)-conearithmetic-geometric exponentialssums of non-negative circuit polynomials

Mathematics Subject Classification ID

Convex programming (90C25) Semidefinite programming (90C22) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Semialgebraic sets and related spaces (14P10) Forms over real fields (11E10) Polynomial optimization (90C23)

Cites Work

• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Title not available (Why is that?)
• Moments, positive polynomials and their applications
• Sums of squares, moment matrices and optimization over polynomials
• Forms derived from the arithmetic-geometric inequality
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Positive polynomials and sums of squares
• Relative entropy relaxations for signomial optimization
• A unified framework of SAGE and SONC polynomials and its duality theory
• Title not available (Why is that?)
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization

Cited In (4)

• Sublinear circuits for polyhedral sets
• Symmetric SAGE and SONC forms, exactness and quantitative gaps
• Sublinear circuits and the constrained signomial nonnegativity problem
• Symmetry Reduction in AM/GM-Based Optimization

Uses Software

• REPOP

This page was built for publication: The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022366)