On interval branch-and-bound for additively separable functions with common variables

DOI10.1007/S10898-012-9928-XMaRDI QIDQ2392130zbMATH OpenOpenAlexFDO

Authors José L. Berenguel, Frédéric Messine, L. G. Casado, I. García, E. M. T. Hendrix

Publication date 1 August 2013

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-012-9928-x

zbMATH Keywords

branch-and-boundinterval arithmeticseparable functions

Mathematics Subject Classification ID

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

Recommendations

• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Subdomain separability in global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• New interval methods for constrained global optimization

Cites work

• A comparison of complete global optimization solvers
• Comparison between Baumann and admissible simplex forms in interval analysis
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• scientific article; zbMATH DE number 3936378 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (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?)
• Introduction to Interval Analysis
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
• New interval methods for constrained global optimization
• Numerical Optimization
• Optimal centered forms
• Rigorous global search: continuous problems
• The cluster problem in multivariate global optimization

Cited in

(6)

• Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
• Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
• (Global) optimization: historical notes and recent developments
• Subdomain separability in global optimization
• Non-convex optimization problems with linear KKT subsystem
• Reformulations for utilizing separability when solving convex MINLP problems

Describes a project that uses

Uses Software

• INTOPT_90

This page was built for publication: On interval branch-and-bound for additively separable functions with common variables

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