Pages that link to "Item:Q1096312"
From MaRDI portal
The following pages link to An unconstrained dual program for computing convex \(C^ 1\)-spline approximants (Q1096312):
Displayed 8 items.
- Convex interval interpolation with cubic splines. II (Q806933) (← links)
- A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines (Q915349) (← links)
- Constrained smoothing of histograms by quadratic splines (Q1192013) (← links)
- Unconstrained duals to partially separable constrained programs (Q1196186) (← links)
- A survey on univariate data interpolation and approximation by splines of given shape (Q1197740) (← links)
- A general projection framework for constrained smoothing. (Q1431205) (← links)
- Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation (Q2385542) (← links)
- Shape constrained smoothing using smoothing splines (Q2488381) (← links)