Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms

DOI10.1007/S10898-006-9043-YzbMATH Open1138.90031OpenAlexW2065895478MaRDI QIDQ995933FDOQ995933

Authors: Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes 

Publication date: 10 September 2007

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

Full work available at URL: https://doi.org/10.1007/s10898-006-9043-y

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

zbMATH Keywords

Box-constrained global optimizationInterval branch and bound methodsSymbolic computing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) General methods in interval analysis (65G40)

Cites Work

• PROFIL/BIAS - A fast interval library
• Testing Unconstrained Optimization Software
• Title not available (Why is that?)
• Title not available (Why is that?)
• A branch-and-bound algorithm for bound constrained optimization problems without derivatives
• Interval Methods for Systems of Equations
• More test examples for nonlinear programming codes
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Title not available (Why is that?)
• Convergence qualification of adaptive partition algorithms in global optimization
• Title not available (Why is that?)
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Title not available (Why is that?)
• A posteriori direction selection rules for interval optimization methods
• Dynamic optimization of interval narrowing algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Experiments with a new selection criterion in a fast interval optimization algorithm
• Interval analysis on directed acyclic graphs for global optimization
• A deterministic algorithm for global optimization
• Global optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Title not available (Why is that?)
• New results on verified global optimization
• Title not available (Why is that?)
• Experiments with new stochastic global optimization search techniques
• Title not available (Why is that?)
• An interval component for continuous constraints.
• Title not available (Why is that?)

Cited In (3)

• Solving kinematics problems by efficient interval partitioning
• Interval subdivision strategies for constrained optimization
• Efficient interval partitioning for constrained global optimization

Uses Software

• PROFIL/BIAS
• minpack

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)