Weighted Complementarity Problems - A New Paradigm for Computing Equilibria
暂无分享,去创建一个
[1] L. Faybusovich. Euclidean Jordan Algebras and Interior-point Algorithms , 1997 .
[2] J. Pach,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[3] Yinyu Ye,et al. A path to the Arrow–Debreu competitive market equilibrium , 2007, Math. Program..
[4] Osman Güler,et al. Barrier Functions in Interior Point Methods , 1996, Math. Oper. Res..
[5] Yinyu Ye,et al. On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP , 1993, Math. Program..
[6] Kurt M. Anstreicher,et al. Volumetric path following algorithms for linear programming , 1997, Math. Program..
[7] E. Eisenberg,et al. CONSENSUS OF SUBJECTIVE PROBABILITIES: THE PARI-MUTUEL METHOD, , 1959 .
[8] L. Faybusovich. Linear systems in Jordan algebras and primal-dual interior-point algorithms , 1997 .
[9] 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..
[10] Kurt M. Anstreicher,et al. Interior-point algorithms for a generalization of linear programming and weighted centring , 2012, Optim. Methods Softw..
[11] J. Faraut,et al. Analysis on Symmetric Cones , 1995 .
[12] J. Frédéric Bonnans,et al. Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem , 1996, Math. Oper. Res..
[13] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[14] H. Upmeier. ANALYSIS ON SYMMETRIC CONES (Oxford Mathematical Monographs) , 1996 .
[15] Shinji Mizuno,et al. An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..
[16] Yinyu Ye,et al. Interior point algorithms: theory and analysis , 1997 .
[17] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[18] Robert M. Freund,et al. Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem , 1993, Math. Program..
[19] Raphael A. Hauser. Self-Scaled Barrier Functions on Symmetric Cones and Their Classification , 2002, Found. Comput. Math..
[20] Clóvis C. Gonzaga,et al. The largest step path following algorithm for monotone linear complementarity problems , 1997, Math. Program..
[21] C. Roos,et al. Interior Point Methods for Linear Optimization , 2005 .
[22] Florian A. Potra,et al. The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path , 2002, Eur. J. Oper. Res..
[23] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[24] Pravin M. Vaidya,et al. A scaling technique for finding the weighted analytic center of a polytope , 1992, Math. Program..
[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] 吉瀬 章子. Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones , 2011 .
[27] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..