A cutting-plane method solves 1D nonnegative spline smoothing as a convex semi-infinite program, converging to the exact solution faster than LRSQP.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
One-Dimensional Nonnegative Spline Smoothing via Convex Semi-Infinite Programming with a Cutting-Plane Method
A cutting-plane method solves 1D nonnegative spline smoothing as a convex semi-infinite program, converging to the exact solution faster than LRSQP.