Simple bounds for solutions of monotone complementarity problems and convex programs
暂无分享,去创建一个
[1] D. R. Smart. Fixed Point Theorems , 1974 .
[2] S. Karamardian. The nonlinear complementarity problem with applications, part 2 , 1969 .
[3] Jorge J. Moré,et al. Classes of functions and feasibility conditions in nonlinear complementarity problems , 1974, Math. Program..
[4] Nimrod Megiddo. A monotone complementarity problem with feasible solutions but no complementary solutions , 1977, Math. Program..
[5] R. T. Rockafellar,et al. A general correspondence between dual minimax problems and convex programs , 1968 .
[6] Richaard W. Cottle. Nonlinear Programs with Positively Bounded Jacobians , 1966 .
[7] O. Mangasarian. Simple computable bounds for solutions of linear complementarity problems and linear programs , 1985 .
[8] S. Karamardian. The nonlinear complementarity problem with applications, part 1 , 1969 .
[9] J. J. Moré. Coercivity Conditions in Nonlinear Complementarity Problems , 1974 .
[10] B. Curtis Eaves,et al. On the basic theorem of complementarity , 1971, Math. Program..
[11] G. Dantzig,et al. Symmetric dual nonlinear programs. , 1965 .
[12] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .
[13] L. Brouwer. Über Abbildung von Mannigfaltigkeiten , 1911 .