Revision as of 09:44, 1 March 2021 edit TheImaCow (talk \| contribs) Extended confirmed users, Rollbackers 85,342 edits Removing link(s) to "NMath Stats": Deleted page: Expired PROD, concern was: Non notable computer software package. Tag: Twinkle ← Previous edit		Revision as of 19:18, 17 March 2021 edit undo 67.182.138.180 (talk) →Input sparsity time algorithms Next edit →
Line 248: ==== Input sparsity time algorithms ==== In 2015, Lee and Sidford showed that, it can be solved in <math>\tilde O((nnz(A) + nd^2)\sqrt{nd}L)</math> time,<ref>{{cite conference\|title= Efficient inverse maintenance and faster algorithms for linear programming \| conference = FOCS '15 Foundations of Computer Science \|last1=Lee\|first1=Yin-Tat\|last2=Sidford\|first2=Aaron \|year=2015\| arxiv = 1503.01752 }}</ref> where <math>nnz(A)</math> represents the number of non-zero elements, and it remains taking <math>O(n^{2.5}L)</math> in the worst case. ==== Current matrix multiplication time algorithm ====

Linear programming: Difference between revisions