Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
From MaRDI portal
Publication:995933
Recommendations
- On interpolatory subdivision symbol formulation and parameter convergence intervals
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Interval subdivision strategies for constrained optimization
- On an interval-partitioning scheme
- Optimization-based subdivision algorithm for reachable sets
- Unified framework of approximating and interpolatory subdivision schemes for construction of class of binary subdivision schemes
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- scientific article; zbMATH DE number 4000636
Cites work
- scientific article; zbMATH DE number 3705806 (Why is no real title available?)
- scientific article; zbMATH DE number 3742519 (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?)
- scientific article; zbMATH DE number 488523 (Why is no real title available?)
- scientific article; zbMATH DE number 1067639 (Why is no real title available?)
- scientific article; zbMATH DE number 2079838 (Why is no real title available?)
- scientific article; zbMATH DE number 2084739 (Why is no real title available?)
- scientific article; zbMATH DE number 757686 (Why is no real title available?)
- scientific article; zbMATH DE number 815479 (Why is no real title available?)
- scientific article; zbMATH DE number 869736 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- A deterministic algorithm for global optimization
- A posteriori direction selection rules for interval optimization methods
- An interval component for continuous constraints.
- Convergence qualification of adaptive partition algorithms in global optimization
- Dynamic optimization of interval narrowing algorithms
- Experiments with a new selection criterion in a fast interval optimization algorithm
- Experiments with new stochastic global optimization search techniques
- Global optimization
- Interval Methods for Systems of Equations
- Interval analysis on directed acyclic graphs for global optimization
- More test examples for nonlinear programming codes
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- New results on verified global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- PROFIL/BIAS - A fast interval library
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Testing Unconstrained Optimization Software
Cited in
(3)
This page was built for publication: Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995933)
