THE APPLICATION OF A NONLINEAR PROGRAMMING ALGORITHM TO A SECOND ORDER REPRESENTATION OF THE PROBLEM,

Abstract

Recently several algorithms have been presented for the solution of nonlinear programming problems. Examples of such work are the procedures of Rosen, Zoutendijk, Fiacco and McCormick, and Graves. In contrast to the amount of theoretical activity, relatively little work has been published on the computational aspects of the algorithms. This paper describes some computational experiments in the area of nonlinear programming. Specifically, working within the framework of an algorithm developed by G. Graves, the authors shall compare the convergence using only first derivatives with the convergence obtained when the algorithm is applied to an expanded natural second order form of the problem requiring second derivatives. First they provide a general description of the nonlinear algorithm with a proof of convergence. Next they give a natural second order form of the problem. Finally, the computational results for four nonlinear problems recently circulated by A. R. Colville of I.B.M. are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1966
Accession Number
AD0641196

Entities

People

  • A. B. Whinston
  • G. W. Graves

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Contrast
  • Convergence
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Nonlinear Programming

Fields of Study

  • Mathematics

Readers

  • Operations Research