Unconstrained duals to partially separable constrained programs
From MaRDI portal
Publication:1196186
DOI10.1007/BF01580906zbMath0777.90041MaRDI QIDQ1196186
Jochen W. Schmidt, Siegfried Dietze
Publication date: 17 December 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items (2)
A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines ⋮ Convex interval interpolation with cubic splines. II
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
- Convex spline interpolants with minimal curvature
- On tridiagonal linear complementarity problems
- An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
- Positivity of cubic polynomials on intervals and positive spline interpolation
- 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
- Dual algorithms for solving convex partially separable optimization problems
- Lagrange multipliers and nonlinear programming
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- On the existence of convex decompositions of partially separable functions
- Convex Analysis
This page was built for publication: Unconstrained duals to partially separable constrained programs
