Revision as of 09:07, 2 September 2021 edit Zfeinst (talk \| contribs) Extended confirmed users 2,722 edits clean up opening text ← Previous edit		Revision as of 20:36, 12 November 2021 edit undo 2003:c9:f704:b282:8d0c:cc20:c441:9871 (talk) added connection to inverse coefficent problems Next edit →
Line 235: == Applications == Semidefinite programming has been applied to find approximate solutions to combinatorial optimization problems, such as the solution of the [[max cut]] problem with an [[approximation ratio]] of 0.87856. SDPs are also used in geometry to determine tensegrity graphs, and arise in control theory as [[Linear matrix inequality\|LMIs]], and in inverse elliptic coefficient problems as convex, non-linear, semidefiniteness constraints.<ref>{{citation\|last1=Harrach\|first1=Bastian\|date=2021\|title=Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming\|journal=Optimization Letters\|language=en\|doi=10.1007/s11590-021-01802-4\|s2cid=235166806}}</ref> . == References ==

Semidefinite programming: Difference between revisions