Computer programs for non‐linear programming (Q3768684)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4027180
Language Label Description Also known as
default for all languages
No label defined
    English
    Computer programs for non‐linear programming
    scientific article; zbMATH DE number 4027180

      Statements

      Computer programs for non‐linear programming (English)
      0 references
      0 references
      1987
      0 references
      adaptive random search
      0 references
      We consider the problem of maximizing a nonlinear or linear objective function subject to nonlinear and/or linear constraints. The approach used is an adaptive random search with some non-random searches built-in. The algorithm begins with a given point which is replaced by another point if the latter satisfies each of the constraints and results in a bigger functional value. The process of moving from one point to a better point is repeated many times. The value of each of the coordinates of the next point is determined by one of several ways; for example, a coordinate is sometimes forced to have the same value as the value of the corresponding coordinate of the current feasible point. In this algorithm, a candidate point receives no further computational considerations as soon as it is found to be unfeasible; this makes the algorithm general. Computer programs illustrating the details of the new algorithm are given and computational results of two numerical test problems from the literature are presented. Optimality was reached in each of these two problems.
      0 references

      Identifiers