Sublinear Circuits and the Constrained Signomial Nonnegativity Problem
From MaRDI portal
Publication:6342699
DOI10.1007/s10107-022-01776-wzbMath1517.14039arXiv2006.06811MaRDI QIDQ6342699
Helen Naumann, Thorsten Theobald, zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Publication date: 11 June 2020
Nonlinear programming (90C30) Real algebraic sets (14P05) Combinatorial aspects of matroids and geometric lattices (05B35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polynomial optimization (90C23)
This page was built for publication: Sublinear Circuits and the Constrained Signomial Nonnegativity Problem