Theoretical rate of convergence for interval inclusion functions

DOI10.1007/s10898-011-9735-9zbMath1259.90104OpenAlexW1969761511MaRDI QIDQ695339

Daniel Scholz

Publication date: 21 December 2012

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

Full work available at URL: https://doi.org/10.1007/s10898-011-9735-9

zbMATH Keywords

interval analysisapproximation algorithmsfacility location problemscontinuous problemsgeometric branch-and-bound

Mathematics Subject Classification ID

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

Related Items (7)

Convergence analysis of Taylor models and McCormick-Taylor models ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ The cluster problem in constrained global optimization ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs ⋮ Differentiable McCormick relaxations ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• Empirical convergence speed of inclusion functions for facility location problems
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
• Continuous location problems and big triangle small triangle: Constructing better bounds
• Optimal centered forms
• Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
• What can interval analysis do for global optimization?
• GBSSS: The generalized big square small square method for planar single- facility location
• The convergence speed of interval methods for global optimization
• A d.c. optimization method for single facility location problems
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• Encyclopedia of Optimization
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited
• Interval Methods for Systems of Equations
• Quadratic convergence in interval arithmetic, part I
• Introduction to global optimization.

This page was built for publication: Theoretical rate of convergence for interval inclusion functions