Concepedia

Karmarkar's Algorithm

Karmarkar's Algorithm is an interior-point method for solving linear programming problems, distinguished from simplex methods by its polynomial-time complexity and its use of projective transformations to iteratively approach the optimal solution from within the feasible region.

119

Publications

10.2K

Citations

155

Authors

92

Institutions

Publications per year

2017–2026

17

Parents

Publications

119

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1991 · 844 citations

, , +16

Interior Methods for Nonlinear Optimization

Anders Forsgren, Philip E. Gill, Margaret H. Wright · SIAM Review · 2002 · 696 citations

, , +10

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

Éva Tardos · Operations Research · 1986 · 485 citations

, , +17

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

Philip E. Gill, Walter Murray, Michael A. Saunders et al. · Mathematical Programming · 1986 · 443 citations

, , +10

An implementation of Karmarkar's algorithm for linear programming

Ilan Adler, Maurício G. C. Resende, Geraldo Veiga et al. · Mathematical Programming · 1989 · 422 citations

, , +11

1–5 of 119

Authors

155

  1. YY
    Yinyu Ye

    Stanford University, United States

    8 publications · 580 citations

    8

    h-index

  2. MJ
    Michael J. Todd

    Cornell University, United States

    7 publications · 564 citations

    7

    h-index

  3. MF
    M. Farasat Shamir

    National University of Computer and Emerging Sciences, Pakistan

    5 publications · 232 citations

    5

    h-index

  4. JC
    Jeffrey C. Lagarias

    AT&T (United States), United States

    5 publications · 405 citations

    5

    h-index

  5. KM
    Kurt M. Anstreicher

    University of Iowa, United States

    5 publications · 92 citations

    5

    h-index

1–5 of 155

Institutions

92

  1. AT&T (United States)

    Bedminster, United States

    9 h-index

    14 publications

    3.1K citations

  2. Cornell University

    Ithaca, United States

    7 h-index

    9 publications

    871 citations

  3. National University of Computer and Emerging Sciences

    Islamabad, Pakistan

    7 h-index

    14 publications

    582 citations

  4. Zhejiang Normal University

    Jinhua, China

    7 h-index

    7 publications

    246 citations

  5. University of Waterloo

    Waterloo, Canada

    5 h-index

    10 publications

    582 citations

  6. Columbia University

    New York, United States

    5 h-index

    5 publications

    152 citations

  7. Nokia (United States)

    Coppell, United States

    4 h-index

    6 publications

    1.6K citations

  8. University of California, Berkeley

    Berkeley, United States

    4 h-index

    8 publications

    2.5K citations

1–8 of 92

Venues

  1. Mathematical Programming

    22 publications · 2.2K citations

    21

    h-index

  2. Mathematics of Operations Research

    11 publications · 654 citations

    10

    h-index

  3. Operations Research

    5 publications · 1.5K citations

    5

    h-index

  4. SIAM Journal on Optimization

    5 publications · 172 citations

    5

    h-index

  5. IEEE Transactions on Power Systems

    4 publications · 456 citations

    4

    h-index

1–5