Article ID Journal Published Year Pages File Type
4635106 Applied Mathematics and Computation 2007 7 Pages PDF
Abstract
In this paper, we propose an interior point method of type projective to minimize a nonlinear function under linear constraints. We combine the approach of linearization with ingredients brought by Karmarkar. The theoretical results deduct of those established later.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
Extension of a projective interior point method for linearly constrained convex programming
Authors
, , ,