Dual algorithms for solving convex partially separable optimization problems (Q1186290)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Dual algorithms for solving convex partially separable optimization problems
scientific article

    Statements

    Dual algorithms for solving convex partially separable optimization problems (English)
    0 references
    0 references
    28 June 1992
    0 references
    For the convex, partially separable nonlinear programming problem a dual program is developed based on the Fenchel duality theory. Duality theorems are proved, i.e. statements about solvability and optimality of the primal and dual program which avoid a duality gap. For completely and tridiagonally separable systems some conclusions and applications are discussed, in particular the computation of cubic and quadratic \(C^ 1\)- splines for interpolation or data smoothing, respectively. In these cases, the conjugate functions of the dual problem can be determined explicitely. Some numerical results are reported. Finally the author investigates briefly triagonal linear complementary and obstacle problems.
    0 references
    convex, partially separable nonlinear programming
    0 references
    duality
    0 references
    quadratic \(C^ 1\)-splines
    0 references
    triagonal linear complementary
    0 references

    Identifiers

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