On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
暂无分享,去创建一个
[1] Shuzhong Zhang,et al. An O(\sqrtn L) Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP , 2005, SIAM J. Optim..
[2] Josef Stoer,et al. Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity , 1998, Math. Program..
[3] F. Potra,et al. Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence , 1995 .
[4] Josef Stoer,et al. On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems , 1999, Numerische Mathematik.
[5] Josef Stoer. High Order Long-Step Methods for Solving Linear Complementarity Problems , 2001, Ann. Oper. Res..
[6] Shinji Mizuno,et al. High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems , 1998, Math. Oper. Res..
[7] Sanjay Mehrotra,et al. Quadratic Convergence in a Primal-Dual Method , 1993, Math. Oper. Res..
[8] Yin Zhang,et al. A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence , 1996, Ann. Oper. Res..
[9] R. Cottle,et al. Sufficient matrices and the linear complementarity problem , 1989 .
[10] Yinyu Ye,et al. On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP , 1993, Math. Program..
[11] K. M. Anstreicher,et al. Interior point methods in mathematical programming , 1996 .
[12] Florian A. Potra,et al. Predictor-corrector algorithm for solvingP*(κ)-matrix LCP from arbitrary positive starting points , 1996, Math. Program..
[13] Xing Liu,et al. Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path , 2005, Optim. Methods Softw..
[14] J. Sturm. Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists , 1996 .
[15] A. Ostrowski. Solution of equations in Euclidean and Banach spaces , 1973 .
[16] Xing Liu,et al. Corrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path , 2006, SIAM J. Optim..
[17] H. Väliaho,et al. P∗-matrices are just sufficient , 1996 .
[18] Florian A. Potra,et al. Efficient Hybrid Algorithms for Finding Zeros of Convex Functions , 1994, J. Complex..
[19] Josef Stoer,et al. The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems , 1998 .
[20] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[21] Clóvis C. Gonzaga,et al. The largest step path following algorithm for monotone linear complementarity problems , 1997, Math. Program..
[22] Florian A Potra,et al. A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $$O(\sqrt{n}L)$$-iteration complexity , 2007, Math. Program..
[23] Yin Zhang,et al. A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..
[24] Stephen J. Wright. A path-following interior-point algorithm for linear and quadratic problems , 1993 .
[25] J. Frédéric Bonnans,et al. On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems , 1997, Math. Oper. Res..
[26] Florian A. Potra,et al. A path following method for LCP withsuperlinearly convergent iteration sequence , 1998, Ann. Oper. Res..
[27] Florian A. Potra,et al. An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming , 1996, SIAM J. Optim..
[28] J. Frédéric Bonnans,et al. Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem , 1996, Math. Oper. Res..
[29] Florian A. Potra,et al. Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems , 2008, SIAM J. Optim..
[30] Yin Zhang,et al. A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..
[31] M. Anitescu,et al. Equivalence Between Different Formulations of the Linear Complementarity Problem , 1997 .
[32] Gongyun Zhao,et al. The curvature integral and the complexity of linear complementarity problems , 1995, Math. Program..
[33] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[34] Shinji Mizuno. A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition , 1996, Math. Oper. Res..
[35] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .
[36] Florian A. Potra,et al. A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity , 2004, Math. Program..
[37] Florian A. Potra,et al. Corrector–predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path , 2007, Math. Program..
[38] Florian A. Potra,et al. A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP , 1997, SIAM J. Optim..
[39] F. Potra,et al. Superlinearly Convergent Infeasible-Interior-Point Algorithm for Degenerate LCP , 1998 .
[40] Stephen J. Wright,et al. A superquadratic infeasible-interior-point method for linear complementarity problems , 1994, Math. Program..
[41] Jun Ji,et al. A predictor-corrector method for solving the P*(k)-matrix lcp from infeasible starting points , 1995 .
[42] Florian A. Potra,et al. AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence , 1996, Ann. Oper. Res..
[43] Florian A. Potra,et al. A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity , 1997, SIAM J. Optim..
[44] Florian A. Potra,et al. Potra The Kantorovich Theorem and interior point methods , 2004 .
[45] Stephen J. Wright,et al. Local convergence of interior-point algorithms for degenerate monotone LCP , 1994, Comput. Optim. Appl..
[46] Jiming Peng,et al. A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function , 2005, SIAM J. Optim..
[47] Kevin A. McShane. Superlinearly Convergent O(√(n) L)-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem , 1994, SIAM J. Optim..
[48] Florian A. Potra,et al. Q-superlinear convergence of the iterates in primal-dual interior-point methods , 2001, Math. Program..