Luo, Shen2006-08-222006-08-2220062006http://hdl.handle.net/10012/1181We propose a family of search directions based on primal-dual entropy in the context of interior point methods for linear programming. This new family contains previously proposed search directions in the context of primal-dual entropy. We analyze the new family of search directions by studying their primal-dual affine-scaling and constant-gap centering components. We then design primal-dual interior-point algorithms by utilizing our search directions in a homogeneous and self-dual framework. We present iteration complexity analysis of our algorithms and provide the results of computational experiments on NETLIB problems.application/pdf429420 bytesapplication/pdfenCopyright: 2006, Luo, Shen. All rights reserved.MathematicsPrimal-Dual entropyInterior-Point AlgorithmreparameterizationMaster Thesis