A Predictor-corrector Interior-point Algorithm for the Semidenite Linear Complementarity Problem Using the Alizadeh-haeberly-overton Search Direction
暂无分享,去创建一个
[1] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[2] Shinji Mizuno,et al. Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming , 1995, SIAM J. Optim..
[3] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[4] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[5] M. Shida,et al. Existence of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP , 1996 .
[6] Stephen P. Boyd,et al. A primal—dual potential reduction method for problems involving matrix inequalities , 1995, Math. Program..
[7] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[8] Florian A. Potra,et al. A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..
[9] Y. Nesterov,et al. Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming , 1994 .
[10] Yin Zhang,et al. On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem , 1994, SIAM J. Optim..
[11] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..
[12] Alexander Graham,et al. Kronecker Products and Matrix Calculus: With Applications , 1981 .
[13] Masakazu Kojima,et al. Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs , 1998, Math. Program..