Pages that link to "Item:Q2821802"
From MaRDI portal
The following pages link to On the Turing model complexity of interior point methods for semidefinite programming (Q2821802):
Displaying 12 items.
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Stochastic numerical approach for solving second order nonlinear singular functional differential equation (Q2286129) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
- Least distortion Euclidean embeddings of flat tori (Q6060342) (← links)
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
- An experimental comparison of methods for computing the numerical radius (Q6197617) (← links)
- On semidefinite programming characterizations of the numerical radius and its dual norm (Q6592215) (← links)
