A cover partitioning method for bound constrained global optimization
From MaRDI portal
Publication:2905347
DOI10.1080/10556788.2011.557726zbMath1250.90071OpenAlexW1992958085WikidataQ60401436 ScholiaQ60401436MaRDI QIDQ2905347
No author found.
Publication date: 27 August 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.557726
Related Items (7)
The robust constant and its applications in random global search for unconstrained global optimization ⋮ Stochastic filter methods for generally constrained global optimization ⋮ Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems ⋮ A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION ⋮ CARTopt: a random search method for nonsmooth unconstrained optimization ⋮ One side cut accelerated random search ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization
Uses Software
Cites Work
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Convergence qualification of adaptive partition algorithms in global optimization
- Lipschitzian optimization without the Lipschitz constant
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Global optimization by continuous grasp
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Semi-Infinite Programming: Theory, Methods, and Applications
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Testing Unconstrained Optimization Software
- Adaptive partitioned random search to global optimization
- Analysis of Generalized Pattern Searches
- On Accelerated Random Search
- Global optimization
This page was built for publication: A cover partitioning method for bound constrained global optimization
