A primal-dual interior-point method based on a new kernel function with linear growth rate
暂无分享,去创建一个
[1] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[2] Jean-Philippe Vial,et al. Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.
[3] Kees Roos,et al. A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization , 2004, SIAM J. Optim..
[4] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[5] Jiming Peng,et al. Self-regular functions and new search directions for linear and semidefinite optimization , 2002, Math. Program..
[6] Kees Roos,et al. A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier , 2002, SIAM J. Optim..
[7] Jiming Peng,et al. Self-regularity - a new paradigm for primal-dual interior-point algorithms , 2002, Princeton series in applied mathematics.