Summary
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.
Similar content being viewed by others
References
Burmeister, W., Hess, W., Schmidt, J.W.: Convex spline interpolation with minimal curvature. Computing35, 219–229 (1985)
Dietze, S., Schmidt, J.W.: Determination of shape preserving spline interpolants with minimal curvature via dual programs. J. Approx. Theory52, 43–57 (1988)
Glowinski, R.: Numerical methods for nonlinear variational problems. New York Berlin Heidelberg Tokyo: Springer 1985
Graf Finck von Finckenstein, K.: Einige Bemerkungen überM-Matrizen. ZAMM57, 491–492 (1977)
Grossmann, C., Kaplan, A.A.: On the solution of discretized obstacle problems by an adapted penalty method. Computing35, 295–306 (1985)
Krätzschmar, M.: On additively decomposeable constrained convex minimization problems (to appear)
Rockafellar, R.T.: Convex analysis. Princeton: Princeton University Press 1970
Schmidt, J.W.: On tridiagonal linear complementarity problems. Numer. Math.51, 11–21 (1987)
Scholz, R.: Numerical solution of the obstacle problem by the penalty method. Computing32, 297–306 (1986)
Scholz, R.: Numerical solution of the obstacle problem by the penalty method. Part II Time dependent problems. Numer. Math.49, 255–268 (1986)
Schwetlick, H.: Numerische Lösung nichtlinearer Gleichungen. München Wien: Oldenbourg 1979
Stoer, J., Witzgall, C.: Convexity and optimization in finite dimensions. Berlin Heidelberg New York: Springer 1970
Zeidler, E.: Vorlesungen über nichtlineare Funktionalanalysis III, Teubner-Texte zur Mathematik. Leipzig: Teubner 1977
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Krätzschmar, M. A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems. Numer. Math. 54, 507–531 (1989). https://doi.org/10.1007/BF01396359
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01396359