A branch-and-bound algorithm for bound constrained optimization problems without derivatives

DOI10.1007/BF01279453zbMath0836.90135OpenAlexW2026826235MaRDI QIDQ1904655

Christian Jansson, Olaf Knüppel

Publication date: 2 May 1996

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

Full work available at URL: https://doi.org/10.1007/bf01279453

zbMATH Keywords

global optimizationbranch-and-boundinterval arithmetic

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items

Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space, A discrete dynamic convexized method for nonlinear integer programming, A hybrid genetic algorithm with the Baldwin effect, Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms, Interval mathematics, algebraic equations and optimization, A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems, A method for solving some optimization problems with bounds on variables

Uses Software

• PROFIL/BIAS
• BRENT

Cites Work

• Global optimization using interval analysis - the multi-dimensional case
• A geometric approach for computing a posteriori error bounds for the solution of a linear system
• On computing the range of a rational function of n variables over a bounded region
• Global optimization using interval analysis: The one-dimensional case
• PROFIL/BIAS - A fast interval library
• Solving minimax problems by interval methods
• A stochastic method for global optimization
• Inclusion functions and global optimization
• Some NP-complete problems in quadratic and nonlinear programming
• Interval Methods for Systems of Equations
• Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
• Computation of rational interval functions
• Modern Error Analysis
• Global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item