Descent methods for composite nondifferentiable optimization problems (Q3705231)

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 3930747
Language Label Description Also known as
default for all languages
No label defined
    English
    Descent methods for composite nondifferentiable optimization problems
    scientific article; zbMATH DE number 3930747

      Statements

      Descent methods for composite nondifferentiable optimization problems (English)
      0 references
      0 references
      1985
      0 references
      descent methods
      0 references
      Clarke subdifferential
      0 references
      \(\epsilon \) -subdifferential
      0 references
      Armijo stepsize
      0 references
      epi-convergence
      0 references
      casting functions
      0 references
      globally defined descent algorithms
      0 references
      non-differentiable objective functions
      0 references
      Modified Newton
      0 references
      Gauss-Newton
      0 references
      Variable-Metric
      0 references
      0 references
      0 references
      0 references
      0 references
      We present a framework for the development of globally defined descent algorithms for the minimization of non-differentiable objective functions \(F:=h\circ f\) with h convex. Within our structure the global convergence properties of the Cauchy, Modified Newton, Gauss-Newton, and Variable- Metric methods are easily established along with that of several new approaches. Examples illustrating the calculational techniques are provided.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references