Safe and tight linear estimators for global optimization
type: Item
instance of: scholarly article
title: Safe and tight linear estimators for global optimization
zbMATH Open document ID: 1066.90087
author: Glencora Borradaile
author: Pascal Van Hentenryck
published in: Mathematical Programming. Series A. Series B
publication date: 2005-04-29T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2162524
zbMATH Keywords: global optimization
zbMATH Keywords: branch and bound algorithms
describes a project that uses: Numerica
MaRDI profile type: Publication
full work available at URL: s10107-004-0533-8
OpenAlex ID: W2081148668
cites work: Applying interval arithmetic to real, integer, and boolean constraints
cites work: Lower bound functions for polynomials
cites work: Generalized convex disjunctive programming: Nonlinear convex hull relaxation
cites work: Solving Polynomial Systems Using a Branch and Prune Approach
cites work: Global Optimization and Constraint Satisfaction
cites work: A rigorous lower bound for the optimal value of convex optimization problems
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Safe bounds in linear and mixed-integer linear programming
cites work: A global optimization algorithm for linear fractional and bilinear programs
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
DOI: 10.1007/S10107-004-0533-8
description: scientific article; zbMATH DE number 2162524