Pages that link to "Item:Q2442641"
From MaRDI portal
The following pages link to On the exhaustivity of simplicial partitioning (Q2442641):
Displaying 6 items.
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- A modified simplex partition algorithm to test copositivity (Q2052385) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- A new certificate for copositivity (Q2418975) (← links)
- On refinement of the unit simplex using regular simplices (Q5964244) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
