A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
暂无分享,去创建一个
[1] B. Eaves. On Quadratic Programming , 1971 .
[2] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[3] J. Dunn. On the convergence of projected gradient processes to singular critical points , 1987 .
[4] Jong-Shi Pang. An equivalence between two algorithms for quadratic programming , 1981, Math. Program..
[5] O. Mangasarian. Solution of symmetric linear complementarity problems by iterative methods , 1977 .
[6] Donald Goldfarb,et al. A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..
[7] B. Ahn. Solution of nonsymmetric linear complementarity problems by iterative methods , 1981 .
[8] W. W. Breckner. Blum, E. / Oettli, W., Mathematische Optimierung, Grundlagen und Verfahren, IX, 413 S., 5 Abb., Berlin‐Heidelberg‐New York. Springer‐Verlag. 1975. DM 148,‐. US $ 60.70 . , 1977 .
[9] E. Beale. On quadratic proramming , 1959 .
[10] A. B. Pevnyi,et al. Numerical methods for finding saddle points , 1972 .
[11] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .
[12] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[13] Boris Polyak,et al. The method of projections for finding the common point of convex sets , 1967 .
[14] J. Dunn. Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes , 1981 .
[15] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[16] Michael J. Best,et al. Equivalence of some quadratic programming algorithms , 1984, Math. Program..
[17] H. Uzawa,et al. Preference, production, and capital: Iterative methods for concave programming , 1989 .
[18] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[19] D. Bertsekas. On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.
[20] P. Wolfe. THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING , 1959 .
[21] Jong-Shi Pang,et al. Inexact Newton methods for the nonlinear complementarity problem , 1986, Math. Program..
[22] D. Kinderlehrer,et al. An introduction to variational inequalities and their applications , 1980 .
[23] J. Dunn. A projected Newton method for minimization problems with nonlinear inequality constraints , 1988 .
[24] R. Fletcher. A General Quadratic Programming Algorithm , 1971 .
[25] Philip E. Gill,et al. Numerically stable methods for quadratic programming , 1978, Math. Program..
[26] M. J. D. Powell,et al. A fast algorithm for nonlinearly constrained optimization calculations , 1978 .
[27] J. Pang. Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem , 1984 .
[28] Paul H. Calamai,et al. Projected gradient methods for linearly constrained problems , 1987, Math. Program..
[29] Boris Polyak,et al. Constrained minimization methods , 1966 .
[30] A. Goldstein. Convex programming in Hilbert space , 1964 .
[31] Shih-Ping Han,et al. Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..