An approach to obtaining global extremums in polynomial mathematical programming problems
From MaRDI portal
Recommendations
Cited in
(32)- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Tight size-degree bounds for sums-of-squares proofs
- Notes on computational-to-statistical gaps: predictions using statistical physics
- Limitations of semidefinite programs for separable states and entangled games
- Some directions and results of research in mathematical programming and system analysis
- Noisy tensor completion via the sum-of-squares hierarchy
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Mean estimation with sub-Gaussian rates in polynomial time
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Complete solutions and extremality criteria to polynomial optimization problems
- Die normalform des quadratischen optimierungsproblems and die pol-polaren-theorie
- Query complexity in expectation
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Class of global minimum bounds of polynomial functions
- On N. Z. Shor's three scientific ideas
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Greedy approaches to symmetric orthogonal tensor decomposition
- The Lovász theta function for random regular graphs and community detection in the hard regime
- Disordered systems insights on computational hardness
- Sum of squares lower bounds from symmetry and a good story
- The Lovász theta function for random regular graphs and community detection in the hard regime
- scientific article; zbMATH DE number 2208673 (Why is no real title available?)
- The Spectrum of the Grigoriev–Laurent Pseudomoments
- Sum-of-squares lower bounds for densest k-subgraph
- Trajectory generation for the unicycle model using semidefinite relaxations
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- Scientific legacy of academician N. Z. Shor
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- On global optimizations with polynomials
This page was built for publication: An approach to obtaining global extremums in polynomial mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801357)
