Dual algorithms for solving convex partially separable optimization problems
From MaRDI portal
Publication:1186290
zbMath0751.90060MaRDI QIDQ1186290
Publication date: 28 June 1992
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
dualityconvex, partially separable nonlinear programmingquadratic \(C^ 1\)-splinestriagonal linear complementary
Numerical smoothing, curve fitting (65D10) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical interpolation (65D05) Spline approximation (41A15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
Powell-Sabin splines in range restricted interpolation of scattered data ⋮ Positive quartic, monotone quintic \(C^ 2\)-spline interpolation in one and two dimensions ⋮ Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation ⋮ Unconstrained duals to partially separable constrained programs
This page was built for publication: Dual algorithms for solving convex partially separable optimization problems
