Global minimization via piecewise-linear underestimation
From MaRDI portal
Recommendations
- Convex kernel underestimation of functions with multiple local minima
- Nonconvex piecewise-quadratic underestimation for global minimization
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- scientific article; zbMATH DE number 1560354
- A nonconvex, piecewise linear optimization problem
Cites work
Cited in
(14)- Piecewise linear bounding functions in univariate global optimization
- Nonconvex piecewise-quadratic underestimation for global minimization
- Convex kernel underestimation of functions with multiple local minima
- Finding the set of global minimizers of a piecewise affine function
- SpaGrOW -- a derivative-free optimization scheme for intermolecular force field parameters based on sparse grid methods
- Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
- Discrete optimization methods to fit piecewise affine models to data points
- Convex piecewise-linear fitting
- Machine learning for global optimization
- Combination of two underestimators for univariate global optimization
- Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning
- Global optimization in protein docking using clustering, underestimation and semidefinite programming
- Multi-funnel optimization using Gaussian underestimation
- Piecewise-linear approximations of multidimensional functions
This page was built for publication: Global minimization via piecewise-linear underestimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569149)