The impact of accelerating tools on the interval subdivision algorithm for global optimization
From MaRDI portal
Publication:1804056
DOI10.1016/0377-2217(93)90110-9zbMATH Open0768.90068OpenAlexW2016196165MaRDI QIDQ1804056FDOQ1804056
Authors: Tibor Csendes, János Pinter 
Publication date: 29 June 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90110-9
Recommendations
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Subdivision Direction Selection in Interval Methods for Global Optimization
- The convergence speed of interval methods for global optimization
- Accelerations for a variety of global optimization methods
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Interval tools for global optimization
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- On an efficient use of gradient information for accelerating interval global optimization algorithms
- scientific article; zbMATH DE number 1054666
- Interval subdivision strategies for constrained optimization
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Some NP-complete problems in quadratic and nonlinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization
- Title not available (Why is that?)
- A stochastic method for global optimization
- Efficiency of a Global Optimization Algorithm
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- An interval arithmetic method for global optimization
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Globally convergent methods for n-dimensional multiextremal optimization
- Inclusion functions and global optimization. II
- Inclusion functions and global optimization
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Title not available (Why is that?)
- An interval method for bounding level sets of parameter estimation problems
- Interval method for bounding level sets: Revisited and tested with global optimization problems
- Title not available (Why is that?)
Cited In (15)
- Subdivision Direction Selection in Interval Methods for Global Optimization
- The extrapolated interval global optimization algorithm
- The convergence speed of interval methods for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- A filled function method applied to nonsmooth constrained global optimization
- Mathematically rigorous global optimization in floating-point arithmetic
- Experiments with new stochastic global optimization search techniques
- A new pruning test for finding all global minimizers of nonsmooth functions
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Subdomain separability in global optimization
- A continuous location model for siting a non-noxious undesirable facility within a geographical region
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- A new interval method for locating the boundary of level sets
- New filled functions for nonsmooth global optimization
- New interval methods for constrained global optimization
This page was built for publication: The impact of accelerating tools on the interval subdivision algorithm for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804056)
