THE TANGENT SEARCH METHOD OF CONSTRAINED MINIMIZATION.

Abstract

This paper describes an adaptation of the Direct Search Method which is designed to find the local minimum of an arbitrary, explicitly-stated function of more than one variable, subject to arbitrary, non-linear constraints. This is sometimes called the general problem of mathematical programming. The algorithm given here usually performs its exploratory procedure in hyperplanes approximately tangent to the constraint hypersurfaces when the base point is in the vicinity of such boundaries. Therefore, the author designates it the 'Tangent Search Method'. Calculation of the partial derivatives of a constraint function is necessary when it is violated. However, the method never requires evaluation of any derivative of the objective function. Performance of Tangent Search on various test problems discussed in this paper is generally superior or similar to results with three other recently-published algorithms. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 17, 1966
Accession Number
AD0632121

Entities

People

  • Roger R. Hilleary

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Test And Evaluation

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design