A class of rank-one positive definite qnasi-newton updates for unconstrained minimizationFootnote²

²Paper presented at the Simposio Nazionale di Anaiisi Numerica, Pavia, October 1981

References

• Greenstadt , J. 1970 . Variations on Variable metric methods . Math, of Comput , 24 : 1 – 18 .
   Web of Science ®Google Scholar
• Schnabel , K. 1977 . Analysing and improving Quasi-Newton methods for Unconstrained Optimization , Cornell University . Report TR 77-320
   Google Scholar
• Broyden , C.G. 1967 . Quasi-NEWTON methods and their application to function minimization . Math, of Comput , 21 : 368 – 381 .
   Web of Science ®Google Scholar
• Huang , H.Y. 1970 . Unified approach to quadratically convergent algorithms for functionminimization . JOTA , 5 : 405 – 423 .
   Google Scholar
• Oren , S.S. 1972 . “ Self-scaling variable metric algorithms for unconstrained minimization ” . In PhD Dissertation , Stanford University .
   Google Scholar
• Brodlie , K.W. , Goublay , A.R. and Greenstadt , J. 1973 . Rank-one and rank-two corrections to positive definite matrices expressed in product form . JIMA , 11 : 73 – 82 .
   Google Scholar
• Spedicato , E. 1975 . Computational experience with Quasi-Newton algorithms for problems of moderately large size Milano Report CISE-N-175
   Google Scholar
• Spedicato , E. 1973 . Computational performance of Huang's symmetric update . Calcolo , 10 : 1 – 27 .
   Google Scholar
• Oren , S.S. and Luenbebgee , D. 1974 . Self-scaling variable metric algorithms:criteria for scaling a class of algorithms . Management Science , 20 : 845 – 862 .
   Web of Science ®Google Scholar
• Kleinmichel , H. 1981 . Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung un-resfcringierter Minimierungsprobleme . Teil 1:Verfahren und grundlegende Eigen- schaften. Numer. Math , 38 : 219 – 228 .
   Web of Science ®Google Scholar
• Spedicato , E. 1975 . A bound on the condition number of rank-two updates and applications to the variable metric method . Calcolo , 12 : 185 – 200 .
   Google Scholar
• Davidon , W.C. 1975 . Optimally conditioned optimization algorithms without line searches . Mathem. Progr , 9 : 1 – 30 .
   Web of Science ®Google Scholar
• Spedicato , E. 1978 . On a conjecture of Dixon and other topics in variable metric methods . Mathem. Progr , 15 : 123 – 129 .
   Web of Science ®Google Scholar
• Oreist , S.S. and Spedicato , E. 1976 . Optimal conditioning of self-scaling variable metric algorithms . Mathem. Progr , 10 : 70 – 90 .
   Web of Science ®Google Scholar
• Oren , S.S. 1974 . On the selection of parameters in self-scaling variable metric algorithms . Mathem. Progr , 7 : 351 – 367 .
   Google Scholar
• Biggs , J. 1971 . Minimization algorithms making use of nonquadratic properties of the object function . JIMA , 8 : 315 – 327 .
   Google Scholar
• Spedicato , E. 1976 . A variable metric method derived from invariancy to nonlinear scaling . JOTA , 20 : 315 – 329 .
   Web of Science ®Google Scholar
• Spedicato , E. 1978 . A note on the determination of the nonlinear scaling parameter in a class of Quasi-Newton algorithms . JIMA , 21 : 285 – 291 .
   Web of Science ®Google Scholar
• Sorensen , J. 1978 . On the Q-superlinear convergence of a collinear scaling algorithm for unconstrained minimization , University of Kentucky . Preprint
   Google Scholar
• Davidon , W.C. Optimization by nonlinear scaling , Trondheim University . Preprint
   Google Scholar
• Kleinmichel , H. 1981 . Quasi-NEWTON-Verfhren vom Rang-Eins-Type zur Lösung unrestringierter Minimierungsproblems . n-Schritt-quadratisehe Konvergenz für Restart-Varianten. Numer. Math , 38 : 229 – 244 .
   Web of Science ®Google Scholar