Sciweavers

83 search results - page 1 / 17
» Warm-Start Strategies in Interior-Point Methods for Linear P...
Sort
View
SIAMJO
2002
100views more  SIAMJO 2002»
13 years 4 months ago
Warm-Start Strategies in Interior-Point Methods for Linear Programming
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
E. Alper Yildirim, Stephen J. Wright
IFIP
2005
Springer
13 years 10 months ago
On Warm Starts for Interior Methods
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...
Anders Forsgren
AOR
2006
95views more  AOR 2006»
13 years 4 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 5 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
12 years 11 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...