The ALGOL 60 Procedure minifun for Solving Non-Linear Optimization Problems

[1]  F. A. Lootsma,et al.  The design of a nonlinear optimization programme for solving technological problems , 1975 .

[2]  R. Fletcher,et al.  Function Minimization Without Evaluating Derivatives - a Review , 1965, Comput. J..

[3]  M. Powell.  A Survey of Numerical Methods for Unconstrained Optimization , 1970 .

[4]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[5]  M. J. D. Powell,et al.  Recent advances in unconstrained optimization , 1971, Math. Program..

[6]  Fa Freerk Lootsma.  Boundary properties of penalty functions for constrained minimization , 1970 .

[7]  J. H. Wilkinson,et al.  Symmetric decomposition of a positive definite matrix , 1965 .

[8]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[9]  M. J. Box.  A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems , 1966, Comput. J..

[10]  R. Fletcher,et al.  A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[11]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[12]  M. R. Osborne,et al.  Methods for unconstrained optimization problems , 1968 .

[13]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[14]  Freek A. Lootsma,et al.  A survey of methods for solving constrained minimization problems via unconstrained minimization , 1977 .

[15]  D. Shanno.  Conditioning of Quasi-Newton Methods for Function Minimization , 1970 .

[16]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .

[17]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..