Numerische Mathematik

, Volume 54, Issue 5, pp 507–531 | Cite as

A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems

  • Michael Krätzschmar


In this paper, we shall be concerned with the solution of constrained convex minimization problems. The constrained convex minimization problems are proposed to be transformable into a convex-additively decomposed and almost separable form, e.g. by decomposition of the objective functional and the restrictions. Unconstrained dual problems are generated by using Fenchel-Rockafellar duality. This decomposition-dualization concept has the advantage that the conjugate functionals occuring in the derived dual problem are easily computable. Moreover, the minimum point of the primal constrained convex minimization problem can be obtained from any maximum point of the corresponding dual unconstrained concave problem via explicit return-formulas. In quadratic programming the decomposition-dualization approach considered here becomes applicable if the quadratic part of the objective functional is generated byH-matrices. Numerical tests for solving obstacle problems in ℝ1 discretized by using piecewise quadratic finite elements and in ℝ2 by using the five-point difference approximation are presented.

Subject Classifications

AMS(MOS):65K10, 65N20, 90C25 CR:G1.6 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burmeister, W., Hess, W., Schmidt, J.W.: Convex spline interpolation with minimal curvature. Computing35, 219–229 (1985)Google Scholar
  2. 2.
    Dietze, S., Schmidt, J.W.: Determination of shape preserving spline interpolants with minimal curvature via dual programs. J. Approx. Theory52, 43–57 (1988)Google Scholar
  3. 3.
    Glowinski, R.: Numerical methods for nonlinear variational problems. New York Berlin Heidelberg Tokyo: Springer 1985Google Scholar
  4. 4.
    Graf Finck von Finckenstein, K.: Einige Bemerkungen überM-Matrizen. ZAMM57, 491–492 (1977)Google Scholar
  5. 5.
    Grossmann, C., Kaplan, A.A.: On the solution of discretized obstacle problems by an adapted penalty method. Computing35, 295–306 (1985)Google Scholar
  6. 6.
    Krätzschmar, M.: On additively decomposeable constrained convex minimization problems (to appear)Google Scholar
  7. 7.
    Rockafellar, R.T.: Convex analysis. Princeton: Princeton University Press 1970Google Scholar
  8. 8.
    Schmidt, J.W.: On tridiagonal linear complementarity problems. Numer. Math.51, 11–21 (1987)Google Scholar
  9. 9.
    Scholz, R.: Numerical solution of the obstacle problem by the penalty method. Computing32, 297–306 (1986)Google Scholar
  10. 10.
    Scholz, R.: Numerical solution of the obstacle problem by the penalty method. Part II Time dependent problems. Numer. Math.49, 255–268 (1986)Google Scholar
  11. 11.
    Schwetlick, H.: Numerische Lösung nichtlinearer Gleichungen. München Wien: Oldenbourg 1979Google Scholar
  12. 12.
    Stoer, J., Witzgall, C.: Convexity and optimization in finite dimensions. Berlin Heidelberg New York: Springer 1970Google Scholar
  13. 13.
    Zeidler, E.: Vorlesungen über nichtlineare Funktionalanalysis III, Teubner-Texte zur Mathematik. Leipzig: Teubner 1977Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Michael Krätzschmar
    • 1
  1. 1.Technische Hochschule DarmstadtDarmstadtFederal Republic of Germany

Personalised recommendations