Piecewise linear bounding functions in univariate global optimization
From MaRDI portal
Publication:2156897
DOI10.1007/s00500-020-05254-3zbMath1491.90151OpenAlexW3057302443MaRDI QIDQ2156897
Publication date: 21 July 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-020-05254-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex envelopes of products of convex and component-wise concave functions
- Univariate geometric Lipschitz global optimization algorithms
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Convergence rate of McCormick relaxations
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- A review of recent advances in global optimization
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- A nonsmooth global optimization technique using slopes: The one-dimensional case
- Rigorous global search: continuous problems
- New interval analysis support functions using gradient information in a global minimization algorithm
- Models for representing piecewise linear cost functions
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A one-dimensional deterministic global minimization algorithm
- A deterministic approach to global box-constrained optimization
- Piecewise linear bounding functions for univariate global optimization
- Global optimization of non-convex piecewise linear regression splines
- Linearly constrained global optimization via piecewise-linear approximation
- Global minimization via piecewise-linear underestimation
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- On the Solution of Discrete Programming Problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Piecewise affine functions as a difference of two convex functions
- Reduction of nonlinear integer separable programming problems∗
- A Sequential Method Seeking the Global Maximum of a Function
- Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
- Convex analysis and global optimization
This page was built for publication: Piecewise linear bounding functions in univariate global optimization
