Subdivision Direction Selection in Interval Methods for Global Optimization
From MaRDI portal
Publication:4340792
DOI10.1137/S0036142995281528zbMath0873.65063OpenAlexW2048801726MaRDI QIDQ4340792
Publication date: 12 June 1997
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036142995281528
global optimizationconvergencenumerical examplesinterval arithmeticinterval subdivisionbranch-and-bound algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (38)
A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ Global convergence and the Powell singular function ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ A branch and bound algorithm for quantified quadratic programming ⋮ A new exclusion test for finding the global minimum ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ Interval Methods for Global Optimization Using the Boxing Method ⋮ Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ Heuristic rejection in interval global optimization ⋮ A proof of Jones' conjecture ⋮ Box particle filtering for nonlinear state estimation using interval analysis ⋮ AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS ⋮ Efficient solution of a class of quantified constraints with quantifier prefix exists-forall ⋮ Bound constrained interval global optimization in the COCONUT environment ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm ⋮ Efficient interval partitioning for constrained global optimization ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ On the complexity of exclusion algorithms for optimization ⋮ New interval methods for constrained global optimization ⋮ A combined global \& local search (CGLS) approach to global optimization ⋮ Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Node selection strategies in interval branch and bound algorithms ⋮ Parallel methods for verified global optimization practice and theory ⋮ New results on verified global optimization ⋮ An improved interval global optimization algorithm using higher-order inclusion function forms ⋮ Interval methods and contractor-based branch-and-bound procedures for verified parameter identification of quasi-linear cooperative system models ⋮ A new pruning test for finding all global minimizers of nonsmooth functions ⋮ A new inclusion function for optimization: kite -- the one-dimensional case
This page was built for publication: Subdivision Direction Selection in Interval Methods for Global Optimization
