Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
type: Item
instance of: scholarly article
title: Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
zbMATH Open document ID: 1138.90031
author: Chandra Sekhar Pedamallu
author: Linet Özdamar
author: Tibor Csendes
published in: Journal of Global Optimization
publication date: 2007-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 65G40
zbMATH DE Number: 5189438
zbMATH Keywords: Box-constrained global optimization
zbMATH Keywords: Interval branch and bound methods
zbMATH Keywords: Symbolic computing
describes a project that uses: PROFIL/BIAS
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10898-006-9043-y
OpenAlex ID: W2065895478
cites work: New results on verified global optimization
cites work: A deterministic algorithm for global optimization
cites work: Experiments with a new selection criterion in a fast interval optimization algorithm
cites work: Q4471947
cites work: Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
cites work: Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
cites work: A posteriori direction selection rules for interval optimization methods
cites work: Q4358251
cites work: Subdivision Direction Selection in Interval Methods for Global Optimization
cites work: An interval component for continuous constraints.
cites work: Q4475670
cites work: Q4277813
cites work: Q4004279
cites work: A branch-and-bound algorithm for bound constrained optimization problems without derivatives
cites work: Q4874512
cites work: PROFIL/BIAS - A fast interval library
cites work: Q3928146
cites work: Dynamic optimization of interval narrowing algorithms
cites work: Q5566070
cites work: Testing Unconstrained Optimization Software
cites work: Interval Methods for Systems of Equations
cites work: Experiments with new stochastic global optimization search techniques
cites work: Convergence qualification of adaptive partition algorithms in global optimization
cites work: Q4833815
cites work: Q4040272
cites work: Q4855524
cites work: On the selection of subdivision directions in interval branch-and-bound methods for global optimization
cites work: Q5659396
cites work: Interval analysis on directed acyclic graphs for global optimization
cites work: More test examples for nonlinear programming codes
cites work: Q3897937
cites work: Global optimization
DOI: 10.1007/S10898-006-9043-Y
Recommended article: On interpolatory subdivision symbol formulation and parameter convergence intervals
Recommended article: Subdivision Direction Selection in Interval Methods for Global Optimization
Recommended article: Q3371334
Recommended article: On an interval-partitioning scheme
Recommended article: Optimization-based subdivision algorithm for reachable sets
Recommended article: Unified framework of approximating and interpolatory subdivision schemes for construction of class of binary subdivision schemes
Recommended article: Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
Recommended article: On the selection of subdivision directions in interval branch-and-bound methods for global optimization
Recommended article: Q4726787
description: scientific article; zbMATH DE number 5189438