Study of multiscale global optimization based on parameter space partition
From MaRDI portal
Publication:620530
DOI10.1007/s10898-010-9540-xzbMath1208.90138OpenAlexW2101143874MaRDI QIDQ620530
Publication date: 19 January 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9540-x
Related Items
Linear scaling and the DIRECT algorithm ⋮ Modified DIRECT Algorithm for Scaled Global Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Objective function features providing barriers to rapid global optimization
- A deterministic global optimization algorithm
- A note on a deterministic global optimization algorithm
- Global optimization using interval analysis - the multi-dimensional case
- A collection of test problems for constrained global optimization algorithms
- Global optimization methods for multimodal inverse problems
- Global optimization using interval analysis: The one-dimensional case
- Test functions with variable attraction regions for global optimization problems
- Lipschitzian optimization without the Lipschitz constant
- A class of test functions for global optimization
- Rigorous global search: continuous problems
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- Advances in interval methods for deterministic global optimization in chemical engineering
- A hybrid descent method for global optimization
- On the multilevel structure of global optimization problems
- A hybrid global optimization method: The multi-dimensional case
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Construction of large-scale global minimum concave quadratic test problems
- DESA: a new hybrid global optimization method and its application to analog integrated circuit sizing
- A wide class of test functions for global optimization
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs
- Deterministic global optimization approach to steady-state distribution gas pipeline networks
- A hybrid method for solving multi-objective global optimization problems
- A new class of test functions for global optimization
- TRUST: A Deterministic Algorithm for Global Optimization
- Convergence properties of simulated annealing for continuous global optimization
- An Automatic Method of Solving Discrete Programming Problems
- Time-frequency localisation operators-a geometric phase space approach: II. The use of dilations
- A theory for multiresolution signal decomposition: the wavelet representation
- Orthonormal bases of compactly supported wavelets
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Generating box-constrained optimization problems
- Iterative Methods for the Localization of the Global Maximum
- The wavelet transform, time-frequency localization and signal analysis
- Ten Lectures on Wavelets
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- A test problem generator for the Steiner problem in graphs
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Convergence Criteria for Genetic Algorithms
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- Deterministic global optimization for nonlinear model predictive control of hybrid dynamic systems
- Algorithm 829
- On Descent from Local Minima
- A Sequential Method Seeking the Global Maximum of a Function
- Deterministic global optimization using interval constraint propagation techniques
- Advances in Neural Networks – ISNN 2005
- Stochastic Algorithms: Foundations and Applications
- Convergence of a simulated annealing algorithm for continuous global optimization.
