A parallel stochastic method for solving linearly constrained concave global minimization problems
From MaRDI portal
Publication:1200631
DOI10.1007/BF00171828zbMath0769.90073MaRDI QIDQ1200631
A. T. Phillips, Mario van Vliet, J. Ben Rosen
Publication date: 16 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00171828
global minimization; Bayesian stopping rule; differentiable strictly concave function over a polytope; multistart technique; parallel stochastic algorithm
90C30: Nonlinear programming
65Y05: Parallel numerical computation
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Theoretical and computational results about optimality-based domain reductions, Sufficient conditions for solving linearly constrained separable concave global minimization problems, A quadratic assignment formulation of the molecular conformation problem, Computational comparison of two methods for constrained global optimization