论文信息 - Generalization of Murty's direct algorithm to linear and convex quadratic programming

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.

M. M. Kostreva | M. Kostreva

[1] T. Brubaker,et al. Nonlinear Parameter Estimation , 1979 .

[2] Jack Dongarra,et al. LINPACK Users' Guide , 1987 .

[3] J. Uhlig. C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice-Hall, Inc. Preis geb. 54 s. net , 1972 .

[4] G. Golub,et al. Numerical techniques in mathematical programming , 1970 .

[5] Jorge J. Moré,et al. Classes of functions and feasibility conditions in nonlinear complementarity problems , 1974, Math. Program..

[6] G. Habetler,et al. Existence theory for generalized nonlinear complementarity problems , 1971 .

[7] S. Karamardian,et al. The complementarity problem , 1972, Math. Program..

[8] J. Tomlin. Robust implementation of Lemke's method for the linear complementarity problem , 1978 .

[9] M. Kostreva. Elasto-hydrodynamic lubrication: A non-linear complementarity problem , 1984 .

[10] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.

[11] G. Forsythe,et al. Computer solution of linear algebraic systems , 1969 .

[12] Michael M. Kostreva,et al. Sets of Generalized Complementarity Problems and P-Matrices , 1980, Math. Oper. Res..

[13] M. Kostreva,et al. On a Direct Algorithm for Nonlinear Complementarity Problems , 1978 .