On The Existence Of Convex Decompositions Of Partially Separable Functions.

Andreas Griewank, Ph.L. Toint

    Research output: Contribution to journalArticlepeer-review


    The concept of a partially separable function f is generalized to include all functions f that can be expressed as a finite sum of element functions f//i whose Hessians have nontrivial nullspaces. Such functions can be efficiently minimized by partitioned variable metric methods, provided that each element function f//i is convex. If this condition is not satisfied, one attempts to convexify the given decomposition by shifting quadratic terms among the original f//i such that the resulting modified element functions are at least locally convex. To avoid tests on the numerical value of the Hessian, the authors study the totally convex case where all locally convex f with a particular separability structure have a convex decomposition. It is shown that total convexity only depends on the associated linear conditions on the Hessian matrix.
    Original languageEnglish
    Pages (from-to)25-49
    Number of pages25
    JournalMathematical Programming
    Issue number1
    Publication statusPublished - 1 Jan 1984


    Dive into the research topics of 'On The Existence Of Convex Decompositions Of Partially Separable Functions.'. Together they form a unique fingerprint.

    Cite this