Pages that link to "Item:Q987509"
From MaRDI portal
The following pages link to Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509):
Displaying 8 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Discussion on: ``A decomposition algorithm for KYP-SDPs'' (Q1937317) (← links)
- Decomposed structured subsets for semidefinite and sum-of-squares optimization (Q2071977) (← links)
- Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- Algorithm 996 (Q4960955) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
