On the Implementation of a Primal-Dual Interior Point Method
暂无分享,去创建一个
This paper gives an approach to implementing a second-order primal-dual interior point method. It uses a Taylor polynomial of second order to approximate a primal-dual trajectory. The computations for the second derivative are combined with the computations for the centering direction. Computations in this approach do not require that primal and dual solutions be feasible. Expressions are given to compute all the higher-order derivatives of the trajectory of interest. The implementation ensures that a suitable potential function is reduced by a constant amount at each iteration.There are several salient features of this approach. An adaptive heuristic for estimating the centering parameter is given. The approach used to compute the step length is also adaptive. A new practical approach to compute the starting point is given. This approach treats primal and dual problems symmetrically.Computational results on a subset of problems available from netlib are given. On mutually tested problems the results show...
[1] Michael J. Todd,et al. A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..
[2] Irvin Lustig,et al. Feasibility issues in a primal-dual interior-point method for linear programming , 1990, Math. Program..