REDUCTION OF MONOTONE LINEAR COMPLEMENTARITY PROBLEMS OVER CONES TO LINEAR PROGRAMS OVER CONES
暂无分享,去创建一个
[1] R. Stephenson. A and V , 1962, The British journal of ophthalmology.
[2] G. Habetler,et al. Existence theory for generalized nonlinear complementarity problems , 1971 .
[3] S. Karamardian. Complementarity problems over cones with monotone and pseudomonotone maps , 1976 .
[4] M. Seetharama Gowda,et al. Generalized linear complementarity problems , 1990, Math. Program..
[5] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .
[6] Yinyu Ye,et al. A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem , 1993, Math. Oper. Res..
[7] M. Kojima. A Primitive Interior Point Algorithm for Semidefinite Programs in , 1994 .
[8] Stephen P. Boyd,et al. Linear Matrix Inequalities in Systems and Control Theory , 1994 .
[9] Jen-Chih Yao,et al. On the generalized complementarity problem , 1994, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.
[10] Osman Güler,et al. Generalized Linear Complementarity Problems , 1995, Math. Oper. Res..
[11] M. Seetharama Gowda,et al. The extended linear complementarity problem , 1995, Math. Program..
[12] J. Frédéric Bonnans,et al. Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem , 1996, Math. Oper. Res..
[13] M. Kojima,et al. Linear Algebra for Semidefinite Programming , 1997 .
[14] Shinji Hara,et al. Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..