Some recent developments in nonlinear programming

  • G. Zoutendijk
Mathematical Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3)


Nonlinear Programming Line Search Direction Problem Unconstrained Optimization Nonlinear Programming Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Abadie, J. and Carpentier, J. 1969 Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints, pp. 37–47 of R. Fletcher (ed.), Optimization, Academic Press.Google Scholar
  2. Bartels, R.H. and Golub, G.H. 1969 The simplex method of linear programming using LU decomposition, Comm. ACM 12, 266–268.CrossRefGoogle Scholar
  3. Broyden, C.G. 1967 Quasi-Newton methods and their application to function minimization, Math. of Computation 21, 368–381.Google Scholar
  4. Buys, J.D. 1972 Dual algorithms for unconstrained optimization problems, thesis, Univ. of Leyden.Google Scholar
  5. Cheney, E.W. and Goldstein A.A. 1959 Newton's method for convex programming and Tchebycheff approximation, Num. Math. 1, 253–268.CrossRefGoogle Scholar
  6. Dantzig, G.B. and Van Slyke, R. 1967 Generalized upper bounding techniques, J. Comp. Systems Sci. 1, 213–226.Google Scholar
  7. Dixon, L.C.W. 1972 Quasi-Newton algorithms generate identical points, Math. Progr. 2, 383–387.CrossRefGoogle Scholar
  8. Fiacco, A.V. and Mc Cormick, G.P. 1968 Nonlinear programming: sequential unconstrained minimization techniques, Wiley.Google Scholar
  9. Fletcher, R. and Powell, M.J.D. 1963 A rapidly converging descent method for minimization, Computer Journal 6, 163–168.Google Scholar
  10. Forrest, J.J.H. and Tomlin, J.A. 1972 Updated triangular factors of the basis to maintain sparsity in the product form simplex method, Math. Progr. 2, 263–278.CrossRefGoogle Scholar
  11. Hestenes, M.R. 1969 Multiplier and gradient methods, Journal Optimization Theory and Appl. 4, 303–320.CrossRefGoogle Scholar
  12. Kelly, J.E. 1960 The cutting plane method for solving convex programs, J. Soc. Industr. Appl. Math. 8, 703–712.CrossRefGoogle Scholar
  13. Lootsma, F.A. 1970 Boundary properties of penalty functions for unconstrained minimization, thesis, Eindhoven Techn. University.Google Scholar
  14. Miller, C. 1963 The simplex method for local separable programming, pp. 89–100 of R.L. Graves and P. Wolfe (eds), Recent Advances in Math. Programming, Mc Graw-Hill.Google Scholar
  15. Robinson, S.M. 1972 A quadratically-convergent algorithm for general nonlinear programming problems, Math. Progr. 3, 145–156.CrossRefGoogle Scholar
  16. Roode, J.D. 1968 Generalized Lagrangean Functions, thesis, Univ. of Leyden.Google Scholar
  17. Wolfe, P. 1967 Methods of nonlinear programming, pp. 97–131 of J. Abadie (ed.), Nonlinear Programming, North-Holland.Google Scholar
  18. Zangwill, W.I. 1969 Nonlinear programming, Prentice-Hall.Google Scholar
  19. G. Zoutendijk 1960 Methods of Feasible Directions, Elsevier.Google Scholar
  20. 1966 Nonlinear programming: a numerical survey, J. Soc. Industr. and Appl. Math. Control 4, 194–210.Google Scholar
  21. 1970a Nonlinear programming, computational methods, pp. 37–85, in J. Abadie (ed.), Nonlinear and integer programming, North-Holland.Google Scholar
  22. 1970b Some algorithms based on the principle of feasible directions, pp. 93–122 of J.B. Rosen, O.L. Mangasarian and K. Ritter, (eds.), Nonlinear programming, Academic Press.Google Scholar
  23. 1973 On linearly constrained nonlinear programming, in: A.R. Goncalvez (ed.), Proceedings of the Figueira da Foz Nato Summerschool on Integer and Nonlinear Programming.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1973

Authors and Affiliations

  • G. Zoutendijk
    • 1
  1. 1.University of LeydenNetherlands

Personalised recommendations