Abstract
This article deals mainly with a comparison of certain computational techniques used for the solution of non-linear constrained mathematical programming problems.
Similar content being viewed by others
References
A.V. Fiacco and G.P. McCormick, “Programming under non-linear constraints by unconstrained minimization: A Primal Dual method”,Management Science 10 (2) (1964).
A.V. Fiacco and G.P. McCormick, “Computational Algorithm for S.U.M.T.”,Managament Science 10 (4) (1964).
A.V. Fiacco and G.P. McCormick, “S.U.M.T. for convex programming with equality constraints”, Research Analysis Corporation, Technical paper TP 155, McLean, Virginia (April, 1965).
R. Fletcher and M.J.D. Powell, “A rapidly convergent method for minimization”,Computer Journal 6 (July, 1963).
N.J. Kelley, “Optimization techniques with applications to aerospace systems”, George Leitmann, ed. (Academic Press, New York, 1962).
I. Kowalik, M.R. Osborne and D.M. Ryan, “A new method for constrained optimization problems”,Operations Research 17 (6) (1969).
D.D. Morrison, “Optimization by least squares”,S.I.A.M. Journal on Numerical Analysis 5 (8) (1968).
M.J.D. Powell, “A method for non-linear constraints in minimization problems”, in:Optimization, Ed. R. Fletcher (Academic Press, New York, 1969).
L.A. Schmit and R.L. Fox, “Advances in the integrated approach to Structural Synthesis”,A.I.A.A.. 6 th Annual Structures and Materials Conference, Palm Springs, California, 1965.
K.P. Wong, “Decentralized planning by vertical decomposition of an economic system: a non-linear approach”, Ph. D. Thesis in National Economic Planning, University of Birmingham.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Asaadi, J. A computational comparison of some non-linear programs. Mathematical Programming 4, 144–154 (1973). https://doi.org/10.1007/BF01584657
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584657