A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
From MaRDI portal
Publication:1113621
DOI10.1007/BF01396359zbMath0661.65060MaRDI QIDQ1113621
Publication date: 1989
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133330
obstacle problems; numerical tests; parallel computation; constrained convex minimization; convex-additively decomposition; Fenchel-Rockafellar dual problem
65K05: Numerical mathematical programming methods
90C25: Convex programming
65Y05: Parallel numerical computation
Related Items
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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
