New quadratic lower bound for multivariate functions in global optimization
From MaRDI portal
Publication:2228598
DOI10.1016/j.matcom.2014.04.013OpenAlexW2025756630MaRDI QIDQ2228598
Hoai An Le Thi, Mohand Ouanes, Trong Phuc Nguyen, Ahmed Zidna
Publication date: 19 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2014.04.013
Related Items
Piecewise quadratic bounding functions for finding real roots of polynomials ⋮ Combination of two underestimators for univariate global optimization ⋮ New Underestimator for Univariate Global Optimization ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Computing the range of values of real functions using B-spline form
- A review of recent advances in global optimization
- Global optimization using interval analysis - the multi-dimensional case
- A practical guide to splines
- A multivariate global optimization using linear bounding functions
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Handbook of global optimization
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- Lower bound functions for polynomials
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Rigorous convex underestimators for general twice-differentiable problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization of Hölder functions
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
