Class of global minimum bounds of polynomial functions
From MaRDI portal
Cites work
Cited in
(66)- Main directions in the development of informatics
- Sum-of-squares rank upper bounds for matching problems
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Sparsity in sums of squares of polynomials
- Symmetry groups, semidefinite programs, and sums of squares
- Some directions and results of research in mathematical programming and system analysis
- Hilbert's 17th problem and best dual bounds in quadratic minimization
- Newton polytopes and relative entropy optimization
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Certifying the global optimality of quartic minimization over the sphere
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Completely positive reformulations for polynomial optimization
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Approximate gcds of polynomials and sparse SOS relaxations
- Computing sum of squares decompositions with rational coefficients
- Numerical multilinear algebra and its applications
- Approximation of the joint spectral radius using sum of squares
- A dynamic inequality generation scheme for polynomial programming
- Geometric control of hybrid systems
- Relative entropy relaxations for signomial optimization
- Sum-of-squares rank upper bounds for matching problems
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- On the determination of the solutions and maximum admissible power of the load flow equation via LMIs
- On the hardest problem formulations for the 0/1 Lasserre hierarchy
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- On the hardest problem formulations for the 0/1 Lasserre hierarchy
- A Lasserre lower bound for the min-sum single machine scheduling problem
- Fault-tolerant control synthesis for a class of nonlinear systems: Sum of squares optimization approach
- On N. Z. Shor's three scientific ideas
- Robust control of uncertain systems: classical results and recent developments
- Bounds for random binary quadratic programs
- A nearly tight sum-of-squares lower bound for the planted clique problem
- SOS is not obviously automatizable, even approximately
- scientific article; zbMATH DE number 7378399 (Why is no real title available?)
- Control analysis and design via randomised coordinate polynomial minimisation
- The random QUBO
- Sum-of-squares bounds via Boolean function analysis
- Certifying unstability of switched systems using sum of squares programming
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
- Tangencies and polynomial optimization
- Properties of the cone of non-negative polynomials and duality
- Sum of Squares Bounds for the Empty Integral Hull Problem
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- How Do Exponential Size Solutions Arise in Semidefinite Programming?
- Approximate graph colouring and the hollow shadow
- Optimality conditions and solution analysis at infinity for nonsmooth optimization problems
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- The Kikuchi hierarchy and tensor PCA
- Sparse intersection checking for sparse polynomial zonotopes
- Approximate graph coloring and the crystal with a hollow shadow
- Scientific legacy of academician N. Z. Shor
- Solution existence and compactness analysis for nonsmooth optimization problems
- A convex polynomial that is not sos-convex
- Non-negative polynomials without hyperbolic certificates of non-negativity
- SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization
- Signomial and polynomial optimization via relative entropy and partial dualization
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Border basis relaxation for polynomial optimization
- Exploiting equalities in polynomial programming
This page was built for publication: Class of global minimum bounds of polynomial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3793944)
