On the Derivation of Continuous Piecewise Linear Approximating Functions
From MaRDI portal
Publication:3386781
DOI10.1287/ijoc.2019.0949OpenAlexW3022329270MaRDI QIDQ3386781
Lingxun Kong, Christos T. Maravelias
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.0949
Related Items (4)
A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting ⋮ 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 ⋮ Asymptotically tight conic approximations for chance-constrained AC optimal power flow
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convex piecewise-linear fitting
- Fitting piecewise linear continuous functions
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- SCIP: solving constraint integer programs
- Semi-infinite programming
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Approximating separable nonlinear functions via mixed zero-one programs
- A polyhedral branch-and-cut approach to global optimization
- Combined strategic and operational planning -- an MILP success story in chemical industry
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Mixed integer models for the stationary case of gas network optimization
- Mixed Integer Linear Programming Formulation Techniques
- Practical Piecewise-Linear Approximation for Monotropic Optimization
- Using Piecewise Linear Functions for Solving MINLPs
- 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
- Two-Segment Separable Programming
- Modelling with integer variables
- Classification and Regression via Integer Optimization
- Global minimization of large-scale constrained concave quadratic problems by separable programming
This page was built for publication: On the Derivation of Continuous Piecewise Linear Approximating Functions
