Revision as of 18:31, 17 January 2024 edit S.J. van Dokkum (talk \| contribs) 1 edit m →Run-time complexity: snd -> and Tags: Mobile edit Mobile app edit Android app edit ← Previous edit		Revision as of 01:58, 28 February 2024 edit undo Jfo17 (talk \| contribs) 56 edits Revert section name change: "Approximation algorithms" has a distinct technical meaning Next edit →
Line 219: * In the [[Blum–Shub–Smale machine]] model, SDF is in the intersection of NP and co-NP. == Algorithms for solving SDPs == ~~== Approximation algorithms ==~~ There are several types of algorithms for ~~approximately~~ solving SDPs. These algorithms output the value of the SDP up to an additive error <math>\epsilon</math> in time that is polynomial in the program description size and <math>\log (1/\epsilon)</math>. === Ellipsoid method ===

Semidefinite programming: Difference between revisions