Pages that link to "Item:Q2802536"

The following pages link to Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536):

Displaying 1 item.

• A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)