Pages that link to "Item:Q3801357"
From MaRDI portal
The following pages link to An approach to obtaining global extremums in polynomial mathematical programming problems (Q3801357):
Displayed 12 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)
- Some directions and results of research in mathematical programming and system analysis (Q1918737) (← 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)