Class of global minimum bounds of polynomial functions
From MaRDI portal
Publication:3793944
DOI10.1007/BF01070233zbMath0648.90058OpenAlexW2049087128MaRDI QIDQ3793944
Publication date: 1987
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01070233
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Signomial and polynomial optimization via relative entropy and partial dualization, Symmetry groups, semidefinite programs, and sums of squares, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy, Sum-of-squares rank upper bounds for matching problems, The Random QUBO, SOS Is Not Obviously Automatizable, Even Approximately, A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem, Approximate gcds of polynomials and sparse SOS relaxations, Computing sum of squares decompositions with rational coefficients, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Certifying the global optimality of quartic minimization over the sphere, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, Some directions and results of research in mathematical programming and system analysis, On the determination of the solutions and maximum admissible power of the load flow equation via LMIS, On N. Z. Shor's three scientific ideas, An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem, Tangencies and polynomial optimization, Geometric control of hybrid systems, 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, Border basis relaxation for polynomial optimization, Generating valid linear inequalities for nonlinear programs via sums of squares, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Unnamed Item, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Bounds for Random Binary Quadratic Programs, On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy, Unnamed Item, Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations, Certifying Unstability of Switched Systems Using Sum of Squares Programming, Robust control of uncertain systems: classical results and recent developments, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Hilbert's 17th problem and best dual bounds in quadratic minimization, Exploiting equalities in polynomial programming, A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem, Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, Norm bounds and underestimators for unconstrained polynomial integer minimization, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Numerical multilinear algebra and its applications, Approximation of the joint spectral radius using sum of squares, Sparsity in sums of squares of polynomials, A convex polynomial that is not sos-convex, Unnamed Item, Certifying Polynomial Nonnegativity via Hyperbolic Optimization, Relative Entropy Relaxations for Signomial Optimization, Fault-tolerant control synthesis for a class of nonlinear systems: Sum of squares optimization approach, Newton polytopes and relative entropy optimization, Main directions in the development of informatics, Sum-of-Squares Rank Upper Bounds for Matching Problems, High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts, Completely positive reformulations for polynomial optimization, Control analysis and design via randomised coordinate polynomial minimisation, Univariate parameterization for global optimization of mixed-integer polynomial problems, A dynamic inequality generation scheme for polynomial programming
Cites Work
