Tighter underestimator for bivariate global optimization

DOI10.1007/S13370-024-01235-ZMaRDI QIDQ7024552zbMATH OpenFDO

Authors Mohand Ouanes

Publication date 20 February 2025

Published in Afrika Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13370-024-01235-Z

zbMATH Keywords

branch and boundconvex/concave testglobal optimizationtighter underestimator

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A global optimization method for minimizing a product of two positive convex functions
• A practical guide to splines
• Bounds for the range of a bivariate polynomial over a triangle
• Combination of two underestimators for univariate global optimization
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Continuous piecewise linear delta-approximations for bivariate and multivariate functions
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• Handbook of global optimization
• New quadratic lower bound for multivariate functions in global optimization
• On a global optimization algorithm for bivariate smooth functions
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

This page was built for publication: Tighter underestimator for bivariate global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7024552)