Interior Point Methods
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Research into algorithms for linear programming which approach the solution through the interior of the feasible polygon, rather than moving around the boundary from vertex to vertex, as simplex methods do. Background; thumbnail sketch; zipped Postscript files of the relevant publications and technical reports of infeasible-interior-point methods, affine-scaling methods, linear algebra issues, log barrier methods, nonlinear problems, applications to process control; and movies that illustrate the behavior of an interior-point method on a linear programming problem with primal dimension 3.|
|Resource Types:||Video, Articles, Preprints|
|Math Topics:||Control Theory, Linear Programming|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.