Citation: | Bi Jinbo. Efficient Algorithm for Unconstrained Optimization Problems ——A Positive Definite Update from Negative Broyden Family[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1997, 6(4): 299-304. |
[1] |
Br oyden C G T he converg ence of a class of double rank minimization algor ithms part 3,4 Journal of the Institute of M athematics and Its Applications,1979,6:76-90,222-236
|
[2] |
Dennis Jr J E,Schnabel R B A view of unconstrained optimization In:Nemhauser G H,ed Handboo ks in OR&M S North Holland:Elsevier Science Publishers B V,1989 1-72
|
[3] |
Deng N Y N umerical methods for unconstrained o ptimizat ions(in Chinese)Beijing:Science Pr ess,1982
|
[4] |
Broyden C G A new double rank minimizat ion algor ithms N otices of the A merican M athematical Society,1969,16:670
|
[5] |
L iu B G N onlinear pr ogramming(in Chinese)Beijing:Beijing Institute of T echnology Press,1988 93-132
|
[6] |
Powell M J D Some global convergence properties of a variable metric alg orithm w ithout ex act line searches In:Co ttle R,L emke C,ed N onlinear Prog ramming Prov idence RI:A M S,1976 53-72
|
[7] |
Byr d R H J,N ocedal,Yuan Y Global convergence of a class of Quasi N ew ton methods on convex problems SIAM Joumal on Numerical Analysis,1987,24:1171-1189
|
[8] |
Himmelblau D M Applied nonlinear prog ramming N ew York:M cGraw Hill Book Company,1972 241
|