Pages that link to "Item:Q3004983"
From MaRDI portal
The following pages link to Approximating Semidefinite Packing Programs (Q3004983):
Displaying 9 items.
- A class of semidefinite programs with rank-one solutions (Q551300) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- An efficiently computable subgraph pattern support measure: counting independent observations (Q2435700) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- Portfolio Selection with Multiple Spectral Risk Constraints (Q5258454) (← links)