Jump to content

Talk:Karmarkar's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 21:41, 30 January 2008 (Signing comment by 84.75.149.134 - ""). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Put into simpler english please!

Do you think any layman with a passing interest in super-computing can understand this?


Confusing

An article about "Karmarkar's algorithm" under the heading "The Algorithm" should present Karmarkar's algorithm and not something else just because the real thing is "rather complicated".

I don't really feel confident enough about interior-point methods to write anything for the article... I _would_ feel ok trying to give an explanation of Karmarkar's algorithm here in the discussion section first for review by some senior mathematicians... Does anyone feel like volunteering for fact checking anything I might put together? —Preceding unsigned comment added by 84.75.149.134 (talk) 21:39, 30 January 2008 (UTC)[reply]