An approach to obtaining global extremums in polynomial mathematical programming problems
From MaRDI portal
Publication:3801357
DOI10.1007/BF01074929zbMath0654.90076MaRDI QIDQ3801357
Publication date: 1987
Published in: Cybernetics (Search for Journal in Brave)
Related Items (23)
Query Complexity in Expectation ⋮ Disordered systems insights on computational hardness ⋮ Noisy tensor completion via the sum-of-squares hierarchy ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ Some directions and results of research in mathematical programming and system analysis ⋮ On N. Z. Shor's three scientific ideas ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ Tight size-degree bounds for sums-of-squares proofs ⋮ Global optimization of polynomials restricted to a smooth variety using sums of squares ⋮ Mean estimation with sub-Gaussian rates in polynomial time ⋮ The Spectrum of the Grigoriev–Laurent Pseudomoments ⋮ Class of global minimum bounds of polynomial functions ⋮ Notes on computational-to-statistical gaps: predictions using statistical physics ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime ⋮ Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation ⋮ Unnamed Item ⋮ Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid ⋮ The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime ⋮ Solving polynomial optimization problems via the truncated tangency variety and sums of squares ⋮ Modified \(r\)-algorithm to find the global minimum of polynomial functions ⋮ Role of redundant constraints for improving dual bounds in polynomial optimization problems
Cites Work
This page was built for publication: An approach to obtaining global extremums in polynomial mathematical programming problems
