Subdivision Direction Selection in Interval Methods for Global Optimization
From MaRDI portal
Publication:4340792
DOI10.1137/S0036142995281528zbMATH Open0873.65063OpenAlexW2048801726MaRDI QIDQ4340792FDOQ4340792
Authors: Tibor Csendes, Dietmar Ratz 
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
Recommendations
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Interval subdivision strategies for constrained optimization
- New subinterval selection criteria for interval global optimization
- Generalized subinterval selection criteria for interval global optimization
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Interval oriented multi-section techniques for global optimization
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Interval methods for global optimization
convergenceglobal optimizationnumerical examplesinterval arithmeticbranch-and-bound algorithmsinterval subdivision
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Cited In (48)
- Interval Methods for Global Optimization Using the Boxing Method
- A combined global \& local search (CGLS) approach to global optimization
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
- A branch and bound algorithm for quantified quadratic programming
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- An improved interval global optimization algorithm using higher-order inclusion function forms
- A new exclusion test for finding the global minimum
- Interval methods and contractor-based branch-and-bound procedures for verified parameter identification of quasi-linear cooperative system models
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- A hybrid subdivision strategy for result-verifying nonlinear solvers
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- A posteriori direction selection rules for interval optimization methods
- Node selection strategies in interval branch and bound algorithms
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Heuristic rejection in interval global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Interval subdivision strategies for constrained optimization
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Bound constrained interval global optimization in the COCONUT environment
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- Parallel methods for verified global optimization practice and theory
- Efficient interval partitioning for constrained global optimization
- A new inclusion function for optimization: kite -- the one-dimensional case
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
- Generalized subinterval selection criteria for interval global optimization
- A new pruning test for finding all global minimizers of nonsmooth functions
- Global convergence and the Powell singular function
- On estimating workload in interval branch-and-bound global optimization algorithms
- 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
- Subdomain separability in global optimization
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Box particle filtering for nonlinear state estimation using interval analysis
- New results on verified global optimization
- A new subdivision strategy for range computations
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
- On the complexity of exclusion algorithms for optimization
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- A proof of Jones' conjecture
- New interval methods for constrained global optimization
This page was built for publication: Subdivision Direction Selection in Interval Methods for Global Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340792)
