Metraipolis › archive › dc_fac0f7831945

Karmarkar's algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T18:39:02.277Z
SHA-256 of the archived text
c12cadda07c742031c0a4d8f6ee229c6560249739f9e3263c8bb9d4dad01ec3f
Stable URL of this page
https://metraipolis.com/documento/dc_fac0f7831945

How to cite

Karmarkar's algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_fac0f7831945 (Metraipolis archive dc_fac0f7831945, sha256 c12cadda07c742031c0a4d8f6ee229c6560249739f9e3263c8bb9d4dad01ec3f)
BibTeX
@misc{dcfac0f7831945,
  title = {Karmarkar's algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_fac0f7831945; sha256 c12cadda07c742031c0a4d8f6ee229c6560249739f9e3263c8bb9d4dad01ec3f},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also polynomial time but proved to be inefficient in practice. Denoting by n {\displaystyle n} the number of variables, m the number of inequality constraints, and L {\displaystyle L} the number of bits of input to the algorithm, Karmarkar's algorithm requires O ( m 1.5 n 2 L ) {\displaystyle O(m^{1.5}n^{2}L)} operations on O ( L ) {\displaystyle O(L)} -digit numbers, as compared to O ( n 3 ( n + m ) L ) {\displaystyle O(n^{3}(n+m)L)} such operations for the ellipsoid algorithm. In "square" problems, when m is in O(n), Karmarkar's algorithm requires O ( n 3.5 L ) {\displaystyle O(n^{3.5}L)} operations on O ( L ) {\displaystyle O(L)} -digit numbers, as compared to O ( n 4 L ) {\displaystyle O(n^{4}L)} such operations for the ellipsoid algorithm. The runtime of Karmarkar's algorithm is thus O ( n 3.5 L 2 ⋅ log L ⋅ log log L ) , {\displaystyle O(n^{3.5}L^{2}\cdot \log L\cdot \log \log L),} using FFT-based multiplication (see Big O notation). Karmarkar's algorithm falls within the class of interior-point methods: the current guess for the solution does not follow the boundary of the feasible set as in the simplex method, but moves through the interior of the feasible region, improving the approximation of the optimal solution by a definite fraction with every iteration and converging to an optimal solution with rational data.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Karmarkar's algorithm» — https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm
Wikidata Q2246305 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2246305
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1301578148, consultata il 2026-10-15T18:03:10.548Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6f802c2460995061b6bdb402b533d1e2aa23da7aed36da98f84881ba109095ad