期刊
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷 26, 期 1, 页码 35-61出版社
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1025136421370
关键词
constrained optimization; interior point method; feasible method; large-scale optimization; nonlinear programming; primal-dual method; sequential quadratic programming; barrier method; trust region method
A slack-based feasible interior point method is described which can be derived as a modification of infeasible methods. The modification is minor for most line search methods, but trust region methods require special attention. It is shown how the Cauchy point, which is often computed in trust region methods, must be modified so that the feasible method is effective for problems containing both equality and inequality constraints. The relationship between slack-based methods and traditional feasible methods is discussed. Numerical results using the KNITRO package show the relative performance of feasible versus infeasible interior point methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据