Pages that link to "Item:Q3801357"

The following pages link to An approach to obtaining global extremums in polynomial mathematical programming problems (Q3801357):

Displaying 26 items.

• On N. Z. Shor's three scientific ideas (Q380646) (← links)
• Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
• Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905) (← links)
• Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
• Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
• Some directions and results of research in mathematical programming and system analysis (Q1918737) (← links)
• Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
• Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
• Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
• Complete solutions and extremality criteria to polynomial optimization problems (Q2505557) (← links)
• Query Complexity in Expectation (Q3448835) (← links)
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors (Q3456878) (← links)
• Class of global minimum bounds of polynomial functions (Q3793944) (← links)
• Greedy Approaches to Symmetric Orthogonal Tensor Decomposition (Q4588941) (← links)
• The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
• Disordered systems insights on computational hardness (Q5055432) (← links)
• (Q5090440) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
• Trajectory generation for the unicycle model using semidefinite relaxations (Q6652228) (← links)
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)