Pages that link to "Item:Q2802536"
From MaRDI portal
The following pages link to Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536):
Displaying 7 items.
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Algorithm 996 (Q4960955) (← links)
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization (Q5169658) (← links)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization (Q5189557) (← links)
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity (Q5757351) (← links)