1J. E. Dennis,A. M. Morshedi,Kathryn Turner. A variable-metric variant of the Karmarkar algorithm for linear programming[J] 1987,Mathematical Programming(1):1～20
2Paul H. Calamai,Jorge J. Moré. Projected gradient methods for linearly constrained problems[J] 1987,Mathematical Programming(1):93～116
3Katta G. Murty,Santosh N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming[J] 1987,Mathematical Programming(2):117～129
4G. Pillo,L. Grippo. An exact penalty function method with global convergence properties for nonlinear programming problems[J] 1986,Mathematical Programming(1):1～18
5Albert G. Buckley. Long vectors for quasi-Newton updates[J] 1986,Mathematical Programming(3):256～275
6M. J. D. Powell,Y. Yuan. A recursive quadratic programming algorithm that uses differentiable exact penalty functions[J] 1986,Mathematical Programming(3):265～278
7Ding-Zhu Du,Xiang-Sung Zhang. A convergence theorem of Rosen’s gradient projection method[J] 1986,Mathematical Programming(2):135～144
8M. J. D. Powell. How bad are the BFGS and DFP methods when the objective function is quadratic?[J] 1986,Mathematical Programming(1):34～47
9Jonathan Goodman. Newton’s method for constrained optimization[J] 1985,Mathematical Programming(2):162～171
10Y. Yuan. On the superlinear convergence of a trust region algorithm for nonsmooth optimization[J] 1985,Mathematical Programming(3):269～285
