Lower bounds on the global minimum of a polynomial
From MaRDI portal
Publication:461443
DOI10.1007/s10589-013-9596-xzbMath1304.90163arXiv1209.3049OpenAlexW2009009651MaRDI QIDQ461443
Jean-Bernard Lasserre, Mehdi Ghasemi, Murray A. Marshall
Publication date: 10 October 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.3049
Nonconvex programming, global optimization (90C26) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Real algebraic and real-analytic geometry (14P99)
Related Items
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, Perturbed sums-of-squares theorem for polynomial optimization and its applications, Newton polytopes and relative entropy optimization
Uses Software
Cites Work
- Unnamed Item
- Lower bounds for a polynomial in terms of its coefficients
- Positive semidefinite diagonal minus tail forms are sums of squares
- A boundary point method to solve semidefinite programs
- A tutorial on geometric programming
- Sufficient conditions for a real polynomial to be a sum of squares
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- Lower Bounds for Polynomials Using Geometric Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
