A new continuation method for complementarity problems with uniformP-functions
暂无分享,去创建一个
[1] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[2] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[3] L. McLinden. An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .
[4] G. Dantzig,et al. POSITIVE (SEMI-) DEFINITE MATRICES AND MATHEMATICAL PROGRAMMING , 1963 .
[5] Richaard W. Cottle. Nonlinear Programs with Positively Bounded Jacobians , 1966 .
[6] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[7] J. J. Moré. Coercivity Conditions in Nonlinear Complementarity Problems , 1974 .
[8] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[9] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[10] Jorge J. Moré,et al. Classes of functions and feasibility conditions in nonlinear complementarity problems , 1974, Math. Program..
[11] E. Allgower,et al. Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .
[12] B. Eaves. The Linear Complementarity Problem , 1971 .
[13] Masakazu Kojima,et al. A unification of the existence theorems of the nonlinear complementarity problem , 1975, Math. Program..