A review of piecewise linearization methods
Summary: Various optimization problems in engineering and management are formulated as nonlinear programming problems. Because of the nonconvexity nature of this kind of problems, no efficient approach is available to derive the global optimum of the problems. How to locate a global optimal solution of a nonlinear programming problem is an important issue in optimization theory. In the last few decades, piecewise linearization methods have been widely applied to convert a nonlinear programming problem into a linear programming problem or a mixed-integer convex programming problem for obtaining an approximated global optimal solution. In the transformation process, extra binary variables, continuous variables, and constraints are introduced to reformulate the original problem. These extra variables and constraints mainly determine the solution efficiency of the converted problem. This study therefore provides a review of piecewise linearization methods and analyzes the computational efficiency of various piecewise linearization methods.
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- A superior representation method for piecewise linear functions
- Linearly constrained global optimization via piecewise-linear approximation
- An effective linear approximation method for separable programming problems
- Practical piecewise-linear approximation for monotropic optimization
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- A PTAS for a class of binary non-linear programs with low-rank functions
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- An analysis of the sensitivity and stability of patients' preferences can lead to more appropriate medical decisions
- Estimating parameter and discretization uncertainties using a laminar-turbulent transition model
- A superior representation method for piecewise linear functions
- Canonical piecewise-linear analysis: Generalized breakpoint hopping algorithm
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- Fully automated differential-linear attacks against ARX ciphers
- Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times
- Lifting-based PWA control: a global solution to handle disturbances in the state space partitions
- Towards a trade-off of interpretability, accuracy and scalability: enhanced formulations in linear classification models
This page was built for publication: A review of piecewise linearization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459497)
