Accession Number:

AD0656904

Title:

MATHEMATICAL PROGRAMMING

Descriptive Note:

Systems research memo.

Corporate Author:

NORTHWESTERN UNIV EVANSTON IL TECHNOLOGICAL INST

Personal Author(s):

Report Date:

1967-06-01

Pagination or Media Count:

31.0

Abstract:

Our objective is to provide a more general theoretical basis for those methods for solving constrained minimization problems that are based on successive unconstrained minimizations of a parametric auxiliary function. In order to do this, we first give basic defining properties of a general auxiliary function and obtain a proof of local convergence for the mildly regulated nonconvex problem. We proceed from this general result to develop a family of auxiliary functions by giving the general function more and more structure, eventually being led to the general form of the penalty functions that conventionally have been utilized. Similarly, the problem structure is increasingly specialized and we deal finally with the convex problem. As expected, stronger results are obtained as additional structure is assumed.

Subject Categories:

  • Administration and Management
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE