An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
From MaRDI portal
Abstract: In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third author. On the other hand, we investigate geometric programming methods for constrained polynomial optimization problems, which were recently developed by Ghasemi and Marshall. We show that the combination of both results yields a new method to solve certain classes of constrained polynomial optimization problems. We test the new method experimentally and compare it to semidefinite programming in various examples.
Recommendations
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Polynomial optimization problems and their relaxations
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Lower bounds for polynomials using geometric programming
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 2009904 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A tutorial on geometric programming
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- An exact Jacobian SDP relaxation for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Computing sum of squares decompositions with rational coefficients
- Disciplined convex programming
- Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Extremal psd forms with few terms
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Graph implementations for nonsmooth convex programs
- Lower bounds for polynomials using geometric programming
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Lower bounds on the global minimum of a polynomial
- Minimizing polynomials via sum of squares over the gradient ideal
- Moments, positive polynomials and their applications
- Nonnegative polynomials and sums of squares
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Positive semidefinite diagonal minus tail forms are sums of squares
- Semidefinite Optimization and Convex Algebraic Geometry
- Sums of squares, moment matrices and optimization over polynomials
- There are significantly more nonnegative polynomials than sums of squares
Cited in
(21)- A Positivstellensatz for sums of nonnegative circuit polynomials
- A convex optimization model for finding non-negative polynomials
- scientific article; zbMATH DE number 4133835 (Why is no real title available?)
- Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
- Harmonic Hierarchies for Polynomial Optimization
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- scientific article; zbMATH DE number 7378399 (Why is no real title available?)
- Constrained polynomial optimization problems with noncommuting variables
- The kinetic space of multistationarity in dual phosphorylation
- A unified framework of SAGE and SONC polynomials and its duality theory
- Nonnegative Polynomials and Circuit Polynomials
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
- Real tropicalization and negative faces of the Newton polytope
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Symmetry reduction in AM/GM-based optimization
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Real zeros of SONC polynomials
This page was built for publication: An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994127)
