Talk:Karmarkar's algorithm
![]() | Mathematics Start‑class Low‑priority | |||||||||
|
This is the talk page for discussing improvements to the Karmarkar's algorithm article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
Put into simpler english please!
Do you think any layman with a passing interest in super-computing can understand this? -- unsigned by 24.56.163.174, 1 July 2007
- Seconded. Mostly I am missing a section with examples. What is this algorithm good for in real life? --BjKa (talk) 11:08, 18 August 2014 (UTC)
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)
Inaccurate
This article is describing the affine-scaling algorithm, not Karmarkar's projective algorithm. Even the canonical form is lost, as are all the geometric ideas!
This is a better source.
- Strang, Gilbert (1987). "Karmarkar's algorithm and its place in applied mathematics". The Mathematical Intelligencer. 9 (2). New York: Springer: 4–10. doi:10.1007/BF03025891. ISSN 0343-6993. MR '''883185'''.
{{cite journal}}
: Check|mr=
value (help); Invalid|ref=harv
(help); Unknown parameter|month=
ignored (help)