Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
From MaRDI portal
Publication:3386779
DOI10.1287/ijoc.2019.0890OpenAlexW2996481748MaRDI QIDQ3386779
Steffen Rebennack, Vitaliy Krasko
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0890
global optimizationpolyhedral functionpiecewise linear functionspline regressionmixed integer linear programming (MILP)linear splinefunction fittingmixed integer quadratic programming (MIQP)splines of degree 1
Related Items
A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting, Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning, A linear programming approach to difference-of-convex piecewise linear approximation, A unified framework for bivariate clustering and regression problems via mixed-integer linear programming, Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error, Leveraged least trimmed absolute deviations, MINLP formulations for continuous piecewise linear function fitting, Data-driven stochastic optimization for distributional ambiguity with integrated confidence region, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\), Non-convex nested Benders decomposition, Asymptotically tight conic approximations for chance-constrained AC optimal power flow
Uses Software
Cites Work
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Best subset selection via a modern optimization lens
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- GLOMIQO: global mixed-integer quadratic optimizer
- Convex piecewise-linear fitting
- Fitting piecewise linear continuous functions
- Adaptively refined dynamic program for linear spline regression
- Least quantile regression via modern optimization
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- SCIP: solving constraint integer programs
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- Global minimum potential energy conformations of small molecules
- Data point selection for piecewise linear curve approximation
- Approximating separable nonlinear functions via mixed zero-one programs
- A polyhedral branch-and-cut approach to global optimization
- OR Forum—An Algorithmic Approach to Linear Regression
- Using Piecewise Linear Functions for Solving MINLPs
- Curve Fitting by Segmented Straight Lines
- Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
- Minimizing Model Fitting Objectives That Contain Spurious Local Minima by Bootstrap Restarting
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Classification and Regression via Integer Optimization
- Approximating Points by a Piecewise Linear Function: I
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Partition Regression
- Some Algorithms for Linear Spline and Piecewise Multiple Linear Regression
- Approximation to Data by Splines with Free Knots
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
