Safe and tight linear estimators for global optimization

DOI10.1007/S10107-004-0533-8MaRDI QIDQ1774166zbMATHOpenAlexFDO

Authors Glencora Borradaile, Pascal Van Hentenryck

Publication date 29 April 2005

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-004-0533-8

zbMATH Keywords

global optimizationbranch and bound algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Recommendations

• A reliable affine relaxation method for global optimization
• An efficient and safe framework for solving optimization problems
• Piecewise linear bounding functions in univariate global optimization
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
• New underestimator for univariate global optimization

Cites work

• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• A global optimization algorithm for linear fractional and bilinear programs
• A rigorous lower bound for the optimal value of convex optimization problems
• Applying interval arithmetic to real, integer, and boolean constraints
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Global Optimization and Constraint Satisfaction
• Lower bound functions for polynomials
• Safe bounds in linear and mixed-integer linear programming
• Solving Polynomial Systems Using a Branch and Prune Approach

Cited in

(5)

• A review of recent advances in global optimization
• (Global) optimization: historical notes and recent developments
• Fast construction of constant bound functions for sparse polynomials
• An efficient and safe framework for solving optimization problems
• Domain reduction techniques for global NLP and MINLP optimization

Describes a project that uses

Uses Software

• Numerica

This page was built for publication: Safe and tight linear estimators for global optimization

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