An exact penalty function method with global convergence properties for nonlinear programming problems (Q3768690)

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 4027186
Language Label Description Also known as
default for all languages
No label defined
    English
    An exact penalty function method with global convergence properties for nonlinear programming problems
    scientific article; zbMATH DE number 4027186

      Statements

      An exact penalty function method with global convergence properties for nonlinear programming problems (English)
      0 references
      0 references
      0 references
      1986
      0 references
      continuously differentiable exact penalty function
      0 references
      constrained nonlinear programming
      0 references
      In the paper a new continuously differentiable exact penalty function is given for the solution of nonlinear programming problems with compact feasible set. Continuously differentiable exact penalty functions were introduced by \textit{R. Fletcher} [in: Integer nonlin. Program., 157-175 (1970; Zbl 0332.90039)] for the equality constrained case; the extension to the inequality constrained case has been studied by \textit{T. Glad} and \textit{E. Polak} [Math. Program. 17, 140-155 (1979; Zbl 0414.90078)] and by the authors [SIAM J. Control Optimization 23, 72-84 (1985; Zbl 0569.90072)]. It is proved that under suitable regularity and compactness assumptions, a complete equivalence can be established between the solution of a constrained nonlinear programming problem and the unconstrained minimization of a differentiable function whose local minimizers are contained in a bounded open set. Also a globally convergent algorithm is defined which cannot produce unbounded sequences, thus overcoming the main drawback of existing algorithms based on exact penalty functions.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references