Exact penalty functions and stability in locally Lipschitz programming (Q3714912)

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 3943569
Language Label Description Also known as
default for all languages
No label defined
    English
    Exact penalty functions and stability in locally Lipschitz programming
    scientific article; zbMATH DE number 3943569

      Statements

      Exact penalty functions and stability in locally Lipschitz programming (English)
      0 references
      0 references
      1984
      0 references
      stability
      0 references
      nondifferentiable optimization
      0 references
      exact penalty functions
      0 references
      locally Lipschitz
      0 references
      first order sufficiency conditions
      0 references
      We extend the theory of exact penalty functions for nonlinear programs whose objective functions and equality and inequality constraints are locally Lipschitz; arbitrary simple constraints are also allowed. Assuming a weak stability condition, we show that for all sufficiently large penalty parameter values an isolated minimum of the nonlinear program is also an isolated local minimum of the exact penalty function. A tight lower bound on the parameter value is provided when certain first order sufficiency conditions are satisfied. We apply these results to unify and extend some results for convex programming. Since several effective algorithms for solving nonlinear programs with differentiable functions rely on exact penalty functions, our results provide a framework for extending these algorithms to problems with locally Lipschitz functions.
      0 references

      Identifiers

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