On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

DOI10.1007/S10898-021-01053-8MaRDI QIDQ2046307zbMATH OpenOpenAlexFDO

Authors Frédéric Messine, Boglárka G.-Tóth, L. G. Casado, E. M. T. Hendrix

Publication date 17 August 2021

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10898-021-01053-8

zbMATH Keywords

affine arithmeticbranch-and-boundinterval arithmeticlinear programmingsimplex

Mathematics Subject Classification ID

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

Recommendations

• On derivative based bounding for simplicial branch and bound
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• Comparison between Baumann and admissible simplex forms in interval analysis
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems

Cites work

• A general reliable quadratic form: An extension of affine arithmetic
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A reliable affine relaxation method for global optimization
• Affine arithmetic: concepts and applications
• Automatic differentiation: techniques and applications
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• Extensions of affine arithmetic: application to unconstrained global optimization
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
• scientific article; zbMATH DE number 3936378 (Why is no real title available?)
• scientific article; zbMATH DE number 2035082 (Why is no real title available?)
• scientific article; zbMATH DE number 1543292 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
• Optimal centered forms
• Rigorous global search: continuous problems
• Simplicial global optimization
• The computation of fixed points and applications
• Tighter bound functions for nonconvex functions over simplexes

Cited in

(5)

• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• On derivative based bounding for simplicial branch and bound
• On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
• Local search versus linear programming to detect monotonicity in simplicial branch and bound
• Tighter underestimator for bivariate global optimization

Describes a project that uses

Uses Software

• Virtual library

This page was built for publication: On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

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