Nonlinear programming using minimax techniques
暂无分享,去创建一个
[1] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..
[2] Anthony V. Fiacco,et al. The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method , 1964 .
[3] Anthony V. Fiacco,et al. Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming , 1964 .
[4] W. Zangwill. Non-Linear Programming Via Penalty Functions , 1967 .
[5] Leon S. Lasdon,et al. Optimization in engineering design , 1967 .
[6] M. R. Osborne,et al. Methods for unconstrained optimization problems , 1968 .
[7] D. M. Ryan,et al. A New Method for Constrained Optimization Problems , 1969, Oper. Res..
[8] G. Alistair Watson,et al. An Algorithm for Minimax Approximation in the Nonlinear Case , 1969, Comput. J..
[9] T. Pietrzykowski. An Exact Potential Method for Constrained Maxima , 1969 .
[10] R. Fletcher,et al. A New Approach to Variable Metric Algorithms , 1970, Comput. J..
[11] E. M. L. Beale,et al. Nonlinear Programming: A Unified Approach. , 1970 .
[12] John W. Bandler,et al. Conditions for a minimax optimum , 1971 .
[13] John W. Bandler,et al. Theory of generalized least pth approximation , 1972 .
[14] Roger Fletcher,et al. An exact penalty function for nonlinear programming with inequalities , 1973, Math. Program..
[15] John W. Bandler,et al. On conditions for optimality in least pth approximation withp → ∞ , 1973 .