Theoretical rate of convergence for interval inclusion functions

DOI10.1007/S10898-011-9735-9MaRDI QIDQ695339zbMATH OpenOpenAlexFDO

Authors Daniel Scholz

Publication date 21 December 2012

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

approximation algorithmscontinuous problemsfacility location problemsgeometric branch-and-boundinterval analysis

Mathematics Subject Classification ID

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

Recommendations

• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• scientific article; zbMATH DE number 1543292
• Geometric branch-and-bound methods for constrained global optimization problems
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results

Cites work

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

Cited in

(10)

• Convergence-order analysis of branch-and-bound algorithms for constrained problems
• The cluster problem in constrained global optimization
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• Geometric branch-and-bound methods for constrained global optimization problems
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• Convergence analysis of Taylor models and McCormick-Taylor models
• Differentiable McCormick relaxations
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
• Empirical convergence speed of inclusion functions for facility location problems

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

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