39 citations · 99 across the 10 of their papers we have counts for
4 papers · 1 filter
CVXPY 1.9: Recent Advances in Optimization Modeling Software
William Zhang, Parth Nobel, Aryaman Jeendgar +3
CVXPY is a Python-embedded domain-specific language for convex optimization that lets users express problems in mathematical notation while the system verifies convexity and reduce…
Sublinear Circuits and the Constrained Signomial Nonnegativity Problem
Riley Murray, Helen Naumann, Thorsten Theobald
Conditional Sums-of-AM/GM-Exponentials (conditional SAGE) is a decomposition method to prove nonnegativity of a signomial or polynomial over some subset of real space. In this…
Signomial and Polynomial Optimization via Relative Entropy and Partial Dualization
Riley Murray, Venkat Chandrasekaran, Adam Wierman
We describe a generalization of the Sums-of-AM/GM Exponential (SAGE) relaxation methodology for obtaining bounds on constrained signomial and polynomial optimization problems. Our…
Newton Polytopes and Relative Entropy Optimization
Riley Murray, Venkat Chandrasekaran, Adam Wierman
Certifying function nonnegativity is a ubiquitous problem in computational mathematics, with especially notable applications in optimization. We study the question of certifying no…