Computational comparison of two methods for constrained global optimization
From MaRDI portal
Publication:1342896
Recommendations
- A parallel stochastic method for solving linearly constrained concave global minimization problems
- scientific article; zbMATH DE number 3913569
- Stochastic global optimization methods part II: Multi level methods
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- scientific article; zbMATH DE number 47153
Cites work
- A parallel stochastic method for solving linearly constrained concave global minimization problems
- Bayesian stopping rules for multistart global optimization methods
- Separable concave minimization via partial outer approximation and branch and bound
- Stochastic global optimization methods part I: Clustering methods
- Sufficient conditions for solving linearly constrained separable concave global minimization problems
Cited in
(8)- scientific article; zbMATH DE number 1463002 (Why is no real title available?)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- A quadratic assignment formulation of the molecular conformation problem
- A parallel stochastic method for solving linearly constrained concave global minimization problems
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- Comparison of deterministic and stochastic approaches to global optimization
- A computational evaluation of two subgradient search methods
- Adaptive memory programming for constrained global optimization
This page was built for publication: Computational comparison of two methods for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342896)
