A linear programming approach to difference-of-convex piecewise linear approximation
From MaRDI portal
Publication:6090153
Cites work
- A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
- Canonical piecewise-linear approximations
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- DC decomposition of nonconvex polynomials with algebraic techniques
- Fitting piecewise linear continuous functions
- Mixed integer linear models for the optimization of dynamical transport networks
- Mixed integer linear programming formulation techniques
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- On the number of segments needed in a piecewise linear approximation
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- Piecewise linear approximation of functions of two variables in MILP models
- Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error
- Piecewise-linear approximations of multidimensional functions
- Pooling problem: alternate formulations and solution methods
- Pyomo -- optimization modeling in Python
- Simplexity of the cube
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Strong formulations for the pooling problem
This page was built for publication: A linear programming approach to difference-of-convex piecewise linear approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090153)
