Sufficient weighted complementarity problems
暂无分享,去创建一个
[1] Behrouz Kheirfam. A predictor-corrector interior-point algorithm for P∗(κ)$P_{*}(\kappa )$-horizontal linear complementarity problem , 2013, Numerical Algorithms.
[2] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[3] Cosmin G. Petra,et al. Corrector-predictor methods for sufficient linear complementarity problems , 2011, Comput. Optim. Appl..
[4] R. Cottle,et al. Sufficient matrices and the linear complementarity problem , 1989 .
[5] Tibor Illés,et al. A polynomial path-following interior point algorithm for general linear complementarity problems , 2010, J. Glob. Optim..
[6] 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..
[7] Yinyu Ye,et al. A path to the Arrow–Debreu competitive market equilibrium , 2007, Math. Program..
[8] Keyvan Amini,et al. Exploring complexity of large update interior-point methods for P*(kappa) linear complementarity problem based on Kernel function , 2009, Appl. Math. Comput..
[9] Florian A. Potra,et al. Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity , 2014, SIAM J. Optim..
[10] E. Eisenberg,et al. CONSENSUS OF SUBJECTIVE PROBABILITIES: THE PARI-MUTUEL METHOD, , 1959 .
[11] Richard W. Cottle,et al. On a subclass of P0 , 1995 .
[12] Y. H. Lee,et al. Complexity of large-update interior point algorithm for P*(kappa) linear complementarity problems , 2007, Comput. Math. Appl..
[13] Gyeong-Mi Cho,et al. A new large-update interior point algorithm for P*(κ) linear complementarity problems , 2008 .
[14] H. Väliaho,et al. P∗-matrices are just sufficient , 1996 .
[15] Etienne de Klerk,et al. On the complexity of computing the handicap of a sufficient matrix , 2011, Math. Program..
[16] M. Anitescu,et al. Equivalence Between Different Formulations of the Linear Complementarity Problem , 1997 .
[17] Shinji Mizuno,et al. High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems , 1998, Math. Oper. Res..
[18] Xing Liu,et al. Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path , 2005, Optim. Methods Softw..
[19] Florian A. Potra,et al. Weighted Complementarity Problems - A New Paradigm for Computing Equilibria , 2012, SIAM J. Optim..
[20] Kurt M. Anstreicher,et al. Interior-point algorithms for a generalization of linear programming and weighted centring , 2012, Optim. Methods Softw..
[21] Tibor Illés,et al. Polynomial Interior Point Algorithms for General Linear Complementarity Problems , 2010, Algorithmic Oper. Res..
[22] Pravin M. Vaidya,et al. A scaling technique for finding the weighted analytic center of a polytope , 1992, Math. Program..
[23] M. Gowda,et al. Reducing a Monotone Horizontal LCP to an LCP , 1995 .
[24] Josef Stoer,et al. Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity , 1998, Math. Program..
[25] Osman Güler,et al. Generalized Linear Complementarity Problems , 1995, Math. Oper. Res..
[27] Florian A. Potra,et al. Corrector–predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path , 2007, Math. Program..
[28] Robert M. Freund,et al. Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem , 1993, Math. Program..
[29] 小島 政和. A Unified approach to interior point algorithms for linear complementarity problems , 1991 .
[30] Josef Stoer. High Order Long-Step Methods for Solving Linear Complementarity Problems , 2001, Ann. Oper. Res..
[31] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[32] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .
[33] Xing Liu,et al. Corrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path , 2006, SIAM J. Optim..
[34] Jiming Peng,et al. A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems , 2000, SIAM J. Optim..