Clustering methods for large scale geometrical global optimization
From MaRDI portal
Recommendations
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Local search based heuristics for global optimization: atomic clusters and beyond
- Fast global optimization of difficult Lennard-Jones clusters
- scientific article; zbMATH DE number 2050773
- Efficient large scale global optimization through clustering-based population methods
Cites work
- A heuristic for the circle packing problem with a variety of containers
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Characterizing complex particle morphologies through shape matching: descriptors, applications, and algorithms
- Cluster Analysis Using Seed Points and Density-Determined Hyperspheres as an Aid to Global Optimization
- Differential evolution methods based on local searches
- Disk packing in a square: a new global optimization approach
- Efficiently packing unequal disks in a circle
- Fast global optimization of difficult Lennard-Jones clusters
- Global optimization of Morse clusters by potential energy transformations
- Global optimization on funneling landscapes
- Global optimization. Theory, algorithms, and applications
- Greedy vacancy search algorithm for packing equal circles in a square
- scientific article; zbMATH DE number 3485507 (Why is no real title available?)
- scientific article; zbMATH DE number 3598385 (Why is no real title available?)
- scientific article; zbMATH DE number 3609472 (Why is no real title available?)
- scientific article; zbMATH DE number 739036 (Why is no real title available?)
- Local search based heuristics for global optimization: atomic clusters and beyond
- New approaches to circle packing in a square. With program codes.
- On the Densest Packing of Spheres in a Cube
- On the limited memory BFGS method for large scale optimization
- Packing equal circles in a square: A deterministic global optimization approach
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
Cited in
(12)- Large-sample results for optimization-based clustering methods
- The cluster problem in constrained global optimization
- Local search based heuristics for global optimization: atomic clusters and beyond
- Efficient large scale global optimization through clustering-based population methods
- A hybrid of Bayesian approach based global search with clustering aided local refinement
- Dissimilarity measures for population-based global optimization algorithms
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
- scientific article; zbMATH DE number 679858 (Why is no real title available?)
- Studies of multi-start clustering for global optimization
- (Global) optimization: historical notes and recent developments
- Network flow problem heuristic reduction using machine learning
- Global optimization in clustering using hyperbolic cross points
This page was built for publication: Clustering methods for large scale geometrical global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5198058)
