[1] |
J. Abadie, (Ed.),Nonlinear programming (North-Holland Publishing Company, Amsterdam, 1967). · Zbl 0153.30601 |
[2] |
J. Abadie and J. Carpentier, ”Some numerical experiments with the GRG method for nonlinear programming,” Paper HR 7422, Electricité de France, 1967. |
[3] |
J. Abadie and J. Carpentier, ”Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints,” in:Optimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 37–47. · Zbl 0254.90049 |
[4] |
A. Auslender, ”Méthodes du second ordre dans les problèmes d’optimisation avec constraintes,”Revue Française d’Informatique et de Recherche Opérationelle, No. R-2 (March–April, 1969). |
[5] |
M. Avriel and A.C. Williams (unpublished manuscript). |
[6] |
Y. Bard and J.L. Greenstadt, ”A modified Newton method for optimization with equality constraints,” in:Optimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 299–306. · Zbl 0215.27503 |
[7] |
E.M.L. Beale,Mathematical programming in practice (Sir Isaac Pitman & Sons, Ltd., London, 1968). |
[8] |
M.J. Box, ”A new method of constrained optimization and a comparison with other methods,”Computer Journal 8 (1965). · Zbl 0142.11305 |
[9] |
C.G. Broyden and W.E. Hart, ”A new algorithm for unconstrained optimization,” Paper presented at the Seventh Mathematical Programming Symposium, The Hague, the Netherlands, Sep. 1970. |
[10] |
A. Charnes and W.W. Cooper, ”Optimizing engineering designs under inequality constraints,”Cahiers Centre Etudes Recherche Opérationelle 6 (1964) 181–187. |
[11] |
E.W. Cheney and A.A. Goldstein, ”Newton’s method for convex programming and Tchebycheff approximation,”Numer. Math. 1 (1959) 253–268. · Zbl 0113.10703 · doi:10.1007/BF01386389 |
[12] |
A.R. Colville, ”A comparative study on nonlinear programming codes,” IBM New York Scientific Center Report, 320-2949, 1968 (revised, June 1970). |
[13] |
R.J. Duffin and E.L. Peterson (unpublished manuscript). |
[14] |
R.J. Duffin, E.L. Peterson and C. Zener,Geometric Programming – Theory and Application (John Wiley & Sons, Inc., New York, 1967). · Zbl 0171.17601 |
[15] |
B.C. Eaves and W.I. Zangwill, ”Generalized cutting plane algorithms,” Working Paper No. 274, Center for Research in Management Science, University of California, Berkeley, California, July 1969. |
[16] |
H. Everett, ”Generalized Lagrange multipliers method for solving problems of optimum allocation of resources,”Operations Research 11: 399–417 (1963). · Zbl 0113.14202 · doi:10.1287/opre.11.3.399 |
[17] |
J.E. Falk, ”Lagrange multipliers and nonlinear programming,”J. Math. Anal. Appl., 19(1) (July 1967). · Zbl 0154.44803 |
[18] |
A.V. Fiacco, ”Sequential unconstrained minimization techniques,” Ph.D. Dissertation, Northwestern University, Evanston, Ill., (June 1967). · Zbl 0171.17905 |
[19] |
A.V. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (John Wiley & Sons, Inc., New York, 1968). · Zbl 0193.18805 |
[20] |
R. Fletcher, ”A class of methods for nonlinear programming with termination and convergence properties,” T.P. 368, A.E.R.E., Harwell, England (May 1969). |
[21] |
R. Fletcher. (Ed.),Optimization (Academic Press, London and New York, 1969). · Zbl 0194.20404 |
[22] |
R. Fletcher and A.P. McCann, ”Acceleration techniques for nonlinear programming,” inOptimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 203–246. · Zbl 0194.47704 |
[23] |
F.J. Gould, ”Extensions of Lagrange multipliers in nonlinear programming,”SIAM Journal of Applied Mathematics 17 (1969) 1280–1297. · Zbl 0191.49001 · doi:10.1137/0117120 |
[24] |
G.W. Graves and A.B. Whinston, ”Application of mathematical programming to regional water quality management,” Paper presented at the Seventh Mathematical Programming Symposium, The Hague, the Netherlands, Sep. 1970. |
[25] |
G.W. Graves and A.B. Whinston, ”The application of a nonlinear programming algorithm to a second order representation of the problem,” Working Paper No. 108, Western Management Science Institute, University of California, Los Angeles, California, 1966. · Zbl 0172.43901 |
[26] |
H.J. Greenberg and W.P. Pierskalla, ”Surrogate mathematical programming,”Operations Research (to appear). · Zbl 0232.90059 |
[27] |
H.J. Greenberg, ”The generalized penalty function – surrogate model,” Technical Report CP 70005, Computer Science/Operations Research Center, Southern Methodist University, Dallas, Texas (March 1970). · Zbl 0261.90056 |
[28] |
J.L. Greenstadt, ”A ricocheting gradient method for nonlinear optimization,”J. Soc. Ind. Appl. Math., 14(3) (1966). · Zbl 0149.16801 |
[29] |
J. Guigou, ”Experiences numeriques comparative concernant la methode du gradient conjugue,”Bulletin de la Direction des Etudes et Recherches, Electricité de France, Série C, No. 2 (1968) pp. 79–92. |
[30] |
H.O. Hartley and R.R. Hocking, ”Convex programming by tangential approximation,”Management Science 9 (1963) 600–612. · Zbl 0995.90606 · doi:10.1287/mnsc.9.4.600 |
[31] |
R. Hooke and T.A. Jeeves, ”Direct search solution of numerical and statistical problems,”J. Assn. Comput. Mach. 8 (1961). · Zbl 0111.12501 |
[32] |
P. Huard, ”Resolution of mathematical programming with nonlinear constraints by the method of centers,” in:Nonlinear Programming, Ed. J. Abadie (North-Holland Publishing Company, Amsterdam, 1967). · Zbl 0157.49701 |
[33] |
J.E. Kelley, Jr., ”The cutting plane method for solving convex programming problems,”J. Soc. Ind. Appl. math. 8(4) (1960) 703–712. · Zbl 0098.12104 · doi:10.1137/0108053 |
[34] |
J. Kowalik, M.R. Osborne and D.M. Ryan, ”A new method for constrained optimization problems,”Operations Research 17(6) (Nov.–Dec. 1969). · Zbl 0183.49005 |
[35] |
H.W. Kuhn and A.W. Tucker, ”Non-linear programming,” in:Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Ed. J. Neyman (University of California Press, Berkeley, 1951) pp. 481–493. · Zbl 0044.05903 |
[36] |
H.P. Kunzi and W. Oettli,Nichtlineare Optimierung: neue Verfahren Bibliographie (Nonlinear Programming: New Methods Bibliography) (Springer Verlag, Berlin) Lecture Notes in Operations Research and Mathematical Systems, No. 16, 1969. |
[37] |
H. Kwakernaak and R.C.W. Strijbos, ”Extremization of functions with equality constraints,” Paper presented at the Seventh Mathematical Programming Symposium, The Hague, the Netherlands, Sep. 1970. · Zbl 0346.90044 |
[38] |
P.J. Laurent and B. Martinet, ”Methodes duales pour le calcul du minimum d’une fonction convexe sur une intersection de convexes,”Colloque d’Optimisation, Nice, 30 juin–5 juillet 1969 (Springer Verlag) (to appear). |
[39] |
V.J. Law and R.H. Fariss, ”Treatment of inequality constraints in nonlinear programming via rotational discrimination,” Paper presented at SIAM National Meeting, June 11–14, 1968. |
[40] |
E.S. Levitin and B.T. Polyak, ”Constrained minimization methods,”U.S.S.R. Computational Mathematics and Mathematical Physics, (English translation), 6(5): 1–50 (Pergamon Press, Ltd., Oxford, 1966). |
[41] |
J.L. Lions and R. Teman, ”Une méthode d’eclatement des operateurs et des constraintes en calcul des variations,”C.R. Acad. Sci. Paris 263 (1966) 563–565. |
[42] |
F.A. Lootsma, ”Hessian matrices of penalty functions for solving constrained-optimization problems,” Philips Research Reports, Vol. 24, pp. 322–330, Gloeilampenfabrieken-Eindhoven-Netherlands, (Aug. 1969). · Zbl 0237.90048 |
[43] |
J. Mátyáš, ”Random optimization,”Automatika i Telemechanica 26 (1965) 246–253. (in Russian). |
[44] |
G.P. McCormick, ”An arc method for nonlinearly constrained programming problems,” MRC Technical Summary Report # 1073, Mathematics Research Center, U.S. Army, University of Wisconsin, Madison, Wisconsin, June 1970. |
[45] |
G.P. McCormick, ”A second order method for the linearly constrained nonlinear programming problem,”Proceedings of the Symposium on Nonlinear Programming Mathematics Research Center, U.S. Army, University of Wisconsin, Madison, Wisconsin, May 4–6, 1970. · Zbl 0231.90049 |
[46] |
G.P. McCormick, ”Global solutions to optimization problems,” unpublished notes. |
[47] |
D.D. Morrison, ”Optimization by least squares,”SIAM Journal of Numerical Analysis 5: (1968) 83–88. · Zbl 0165.50304 · doi:10.1137/0705006 |
[48] |
I.B. Motkus, ”On a method of distributing random tests in solving many-extremum problems.” |
[49] |
W. Murray, ”An algorithm for constrained minimization,” in:Optimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 247–258. · Zbl 0194.47702 |
[50] |
W. Murray, ”Behaviour of Hessian matrices of barrier and penalty functions arising in optimization,” Ma. 77, National Physical Laboratory, April 1969. |
[51] |
B.A. Murtagh and R.W.H. Sargent, ”A constrained minimization method with quadratic convergence,” in:Optimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 215–346. · Zbl 0214.42401 |
[52] |
J.A. Nelder and R. Mead, ”A simplex method for function minimization,”Computer Journal 7 (1965) 308. · Zbl 0229.65053 |
[53] |
L.D. Pascual and A. Ben-Israel, ”Constrained minimization of posynomials by geometric programming,” Series in Applied Mathematics, Report No. 69-3, Northwestern University, Evanston, Ill. (1969). |
[54] |
U. Passy and D.J. Wilde, ”Generalized polynomial optimization,”SIAM Journal of Applied Mathematics 15 (1967) 1344–1356. · Zbl 0171.18002 · doi:10.1137/0115117 |
[55] |
T. Pietrzykowski, ”An exact potential method for constrained maxima,”SIAM Journal Numerical Analysis 6(2) (June 1969). · Zbl 0181.46501 |
[56] |
M.J.D. Powell, ”A method for nonlinear constraints in minimization problems,” in:Optimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 283–298. · Zbl 0194.47701 |
[57] |
R.E. Pugh, ”A language for nonlinear programming problems,” RAC-TP-407, Research Analysis Corporation, McLean, Virginia (1970). · Zbl 0212.29102 |
[58] |
J.D. Roode, ”Generalized Lagrangian functions and mathematical programming,” in:Optimization, Ed. R. Fletcher (Academic Press, London and New York, 1969) pp. 327–338. · Zbl 0212.23904 |
[59] |
J.B. Rosen, ”The gradient projection method for nonlinear programming, Part II; nonlinear constraints,”J. Soc. Ind. Appl. Math. 9 (1961) 514–532. · Zbl 0231.90048 · doi:10.1137/0109044 |
[60] |
R.W.H. Sargent and B.A. Murtagh, ”Projection methods for nonlinear programming,” Paper presented at the Seventh Mathematical Programming Symposium, The Hague, the Netherlands, Sep. 1970. |
[61] |
D.J. Wilde and G. Blau (unpublished manuscript). |
[62] |
D.J. Wilde and C.S. Beightler,Foundations of optimization (Prentice-Hall, Englewood, N.J., 1967). · Zbl 0189.19702 |
[63] |
R.B. Wilson, ”A simplicial method for convex programming,” Dissertation, Harvard University (1963). |
[64] |
R.E.D. Woolsey (private communication). |
[65] |
W.I. Zangwill,Nonlinear Programming: a unified approach, Prentice-Hall International Series in Management Science (Prentice-Hall, Inc., Englewood Cliffs, N.J., 1969). |
[66] |
G. Zoutendijk, ”Algorithm based on the principle of feasible directions,” Paper presented at the Nonlinear Programming Symposium, Madison, Wisconsin, May 4–6, 1970. · Zbl 0254.90050 |
[67] |
G. Zoutendijk,Methods of feasible directions (Elsevier Publishing Company, Amsterdam and New York, 1960). · Zbl 0097.35408 |