Piecewise polynomial regression of tame functions via integer programming

DOI10.1016/J.CAGD.2026.102617MaRDI QIDQ7411416zbMATH OpenFDO

Authors Gilles Bareilles, Johannes Aspman, Jiří Němeček, Jakub Mareček

Publication date 2026

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAGD.2026.102617

zbMATH Keywords

mixed-integer programmingNURBSo-minimal structuresuniversal approximation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mixed integer programming (90C11)

Cites work

• \(C^m\) extension by linear operators
• A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
• A practical guide to splines
• Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization
• Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees
• An algorithm for computing constrained smoothing spline functions
• Automatic fairing algorithm for B-spline curves
• CART and best-ortho-basis: a connection
• Clarke Subgradients of Stratifiable Functions
• Conormal spaces and Whitney stratifications
• Constrained approximation by splines with free knots
• Geometric categories and o-minimal structures
• Global convergence of the gradient method for functions definable in o-minimal structures
• scientific article; zbMATH DE number 45848 (Why is no real title available?)
• scientific article; zbMATH DE number 1160037 (Why is no real title available?)
• MINLP formulations for continuous piecewise linear function fitting
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Monotonic Smoothing Splines Fitted by Cross Validation
• Multivariate simultaneous approximation
• Near-optimal nonlinear regression trees
• Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools
• Nonsmoothness in machine learning: specific structure, proximal identification, and applications
• On calculating with B-splines
• On the triple-parameter least squares progressive iterative approximation and its convergence analysis
• Optimal classification trees
• Optimization of a NURBS representation
• Polynomial approximation in several variables
• Progress in mathematical programming solvers from 2001 to 2020
• Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
• Stochastic subgradient descent escapes active strict saddles on weakly convex functions
• Stochastic subgradient method converges on tame functions
• Sur la meilleure approximation de \(| x|\) par des polynomes de degrés donnés.
• The complexity of stratification computation
• The topological correctness of PL approximations of isomanifolds
• Tracing Isomanifolds in \(\mathbb{R}\) ^d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
• Two novel iterative approaches for improved LSPIA convergence
• Verdier and strict Thom stratifications in o-minimal structures

This page was built for publication: Piecewise polynomial regression of tame functions via integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411416)