An algorithm for solving two-level convex optimization problems (Q3330979)

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 3862938
Language Label Description Also known as
default for all languages
No label defined
    English
    An algorithm for solving two-level convex optimization problems
    scientific article; zbMATH DE number 3862938

      Statements

      An algorithm for solving two-level convex optimization problems (English)
      0 references
      1984
      0 references
      large-scale optimization
      0 references
      gradient methods
      0 references
      steepest descent
      0 references
      differentiability rule
      0 references
      two-level convex optimization
      0 references
      algorithm
      0 references
      subgradient formula
      0 references
      The authors have proposed a simple algorithm for solving a two-level convex optimization problem. The algorithm is based on the subgradient formula for the upper level objective function and a rule is given whether this function is differentiable or not at some point. A descent direction finding problem to be solved at ''non-differentiable'' points has been formulated as a linear programming problem. The performance of the algorithm is illustrated by a simple numerical example.
      0 references
      0 references

      Identifiers

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