Pages that link to "Item:Q1013977"
From MaRDI portal
The following pages link to Recognizing underlying sparsity in optimization (Q1013977):
Displaying 7 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Strong practical stability and stabilization of uncertain discrete linear repetitive processes (Q5397314) (← links)
