Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Karmarkar's algorithm

Known as: Karmarkar algorithm, Projective method, Karmarkar's interior-point algorithm 
Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably… Expand
Wikipedia

Related topics

Related topics

21 relations
Affine scalingAlgorithmBarrier functionCombinatorica
Expand

Broader (1)

Linear programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Advanced Graphics Programming Using OpenGL
Part I Computer Graphics Intro and OpenGL: Concepts Geometry Representation & Modeling 3D Transformations Color, Lighting, and… Expand
  • figure 1.8
  • figure 1.12
  • figure 2.10
  • figure 4.1
  • figure 7.2
Is this relevant?
2005
2005
An extension of Karmarkar's algorithm for linear programming using dual variables
We describe an extension of Karmarkar's algorithm for linear programming that handles problems with unknown optimal value and… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Sequential Updating of Projective and Affine Structure from Motion
A structure from motion algorithm is described which recovers structure and camera position, modulo a projective ambiguity… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The projective method for solving linear matrix inequalities
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
We show that a variant of Karmarkar's projective algorithm for linear programming can be viewed as following the approach of… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
An implementation of Karmarkar's algorithm for linear programming
This paper describes the implementation of power series dual affine scaling variants of Karmarkar's algorithm for linear… Expand
  • figure 8.1
  • figure 8.2
  • figure 8.3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
An extension of Karmarkar's projective algorithm for convex quadratic programming
We present an extension of Karmarkar's linear programming algorithm for solving a more general group of optimization problems… Expand
Is this relevant?
1989
1989
Power series variants of Karmarkar-type algorithms
Many interior-point linear programming algorithms have been proposed since the Karmarkar algorithm for linear programming… Expand
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
This paper describes data structures and programming techniques used in an implementation of Karmarkar's algorithm for linear… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A polynomial-time algorithm, based on Newton's method, for linear programming
A new interior method for linear programming is presented and a polynomial time bound for it is proven. The proof is… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE