A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
暂无分享,去创建一个
[1] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[2] Kunio Tanabe,et al. Centered newton method for mathematical programming , 1988 .
[3] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[4] R. C. Monteiro,et al. Interior path following primal-dual algorithms , 1988 .
[5] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[6] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[7] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..
[8] I. Lustig,et al. Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick! , 1990 .
[9] Shinji Mizuno,et al. Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems , 1990, Math. Oper. Res..
[10] Irvin Lustig,et al. Feasibility issues in a primal-dual interior-point method for linear programming , 1990, Math. Program..
[11] I. Lustig,et al. Computational experience with a primal-dual interior point method for linear programming , 1991 .
[12] Shinji Mizuno,et al. A primal—dual infeasible-interior-point algorithm for linear programming , 1993, Math. Program..
[13] Sanjay Mehrotra,et al. Quadratic Convergence in a Primal-Dual Method , 1993, Math. Oper. Res..
[14] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[15] Yinyu Ye,et al. On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP , 1993, Math. Program..
[16] Shinji Mizuno,et al. A little theorem of the bigℳ in interior point algorithms , 1993, Math. Program..
[17] Yin Zhang,et al. A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..
[18] Shinji Mizuno,et al. Polynomiality of infeasible-interior-point algorithms for linear programming , 1994, Math. Program..
[19] 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..
[20] Stephen J. Wright. An infeasible-interior-point algorithm for linear complementarity problems , 1994, Math. Program..
[21] Florian A. Potra,et al. A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting points , 1994, Math. Program..
[22] J. Stoer. The complexity of an infeasible interior-point path-following method for the solution of linear programs , 1994 .
[23] Shinji Mizuno,et al. An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..
[24] Osman Güler,et al. Generalized Linear Complementarity Problems , 1995, Math. Oper. Res..
[25] Shinji Mizuno,et al. Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming , 1995, SIAM J. Optim..
[26] Robert M. Freund,et al. An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution , 1996, Ann. Oper. Res..
[27] Shinji Mizuno,et al. An infeasible-interior-point algorithm using projections onto a convex set , 1996, Ann. Oper. Res..
[28] Florian A. Potra,et al. AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence , 1996, Ann. Oper. Res..
[29] Florian A. Potra,et al. An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming , 1996, SIAM J. Optim..
[30] Jianming Miao. Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming , 1996, SIAM J. Optim..