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

DOI10.1007/BF01396359zbMath0661.65060OpenAlexW2349337489MaRDI QIDQ1113621

Michael Krätzschmar

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133330

zbMATH Keywords

obstacle problemsnumerical testsparallel computationconstrained convex minimizationconvex-additively decompositionFenchel-Rockafellar dual problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)

Related Items (3)

An unconstrained dual program for computing convex \(C^ 1\)-spline approximants ⋮ A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems ⋮ Unconstrained duals to partially separable constrained programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical solution of the obstacle problem by the penalty method
• Convex spline interpolants with minimal curvature
• On the solution of discretized obstacle problems by an adapted penalty method
• Numerical solution of the obstacle problem by the penalty method. II: Time-dependent problems
• On tridiagonal linear complementarity problems
• Determination of shape preserving spline interpolants with minimal curvature via dual programs
• A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
• Einige Bemerkungen über M-Matrizen
• Convex Analysis

This page was built for publication: A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems