9 citations · 17 across the 5 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2026
One-Dimensional Nonnegative Spline Smoothing via Convex Semi-Infinite Programming with a Cutting-Plane Method
Hiroki Arai, Daichi Kitahara
Spline functions are smooth piecewise polynomials widely used for interpolation and smoothing, and nonnegative spline smoothing is also studied for nonnegative data. Previous resea…
math.OC2019★ 7 cited
Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
Laurent Condat, Daichi Kitahara, Andrés Contreras +1
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as pr…