Pages that link to "Item:Q1414710"
From MaRDI portal
The following pages link to Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710):
Displaying 8 items.
- Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
- An exact duality theory for semidefinite programming and its complexity implications (Q1373732) (← links)
- Diagonal matrix scaling is NP-hard (Q1908195) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- A procedure of Chvátal for testing feasibility in linear programming and matrix scaling (Q2496650) (← links)