Norm bounds and underestimators for unconstrained polynomial integer minimization

DOI10.1007/s00186-017-0608-yzbMath1408.90324arXiv1502.05107OpenAlexW2963814313MaRDI QIDQ684153

Anita Schöbel, Sönke Behrends, Ruth Hübner

Publication date: 9 February 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

branch and boundpolynomialslower boundsinteger optimization

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (1)

On stability and the Łojasiewicz exponent at infinity of coercive polynomials

Uses Software

• CSDP
• Sostools
• SDPT3
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook on semidefinite, conic and polynomial optimization
• Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
• Pseudo-Boolean optimization
• On the complexity of Putinar's Positivstellensatz
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
• Integer optimization on convex semialgebraic sets
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• Ellipsoid Bounds for Convex Quadratic Integer Programming
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• 50 Years of Integer Programming 1958-2008
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Class of global minimum bounds of polynomial functions
• L’algebre de Boole et ses applications en recherche operationnelle
• Optimization of Polynomial Functions
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• CSDP, A C library for semidefinite programming
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Semidefinite Optimization and Convex Algebraic Geometry
• Optimization of Polynomials on Compact Semialgebraic Sets
• Integer Polynomial Optimization in Fixed Dimension
• Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Norm bounds and underestimators for unconstrained polynomial integer minimization