A parallel stochastic method for solving linearly constrained concave global minimization problems

DOI10.1007/BF00171828MaRDI QIDQ1200631zbMATH OpenOpenAlexFDO

Authors A. T. Phillips, J. B. Rosen, Mario van Vliet

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

zbMATH Keywords

global minimizationBayesian stopping ruledifferentiable strictly concave function over a polytopemultistart techniqueparallel stochastic algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A parallel algorithm for constrained concave quadratic global minimization
• Concurrent stochastic methods for global optimization
• Computational comparison of two methods for constrained global optimization
• scientific article; zbMATH DE number 1163103
• A Stochastic Method for Constrained Global Optimization

Cited in

(8)

• scientific article; zbMATH DE number 761259 (Why is no real title available?)
• Sufficient conditions for solving linearly constrained separable concave global minimization problems
• scientific article; zbMATH DE number 1109408 (Why is no real title available?)
• Theoretical and computational results about optimality-based domain reductions
• A quadratic assignment formulation of the molecular conformation problem
• Computational comparison of two methods for constrained global optimization
• A Stochastic Method for Constrained Global Optimization
• A parallel algorithm for constrained concave quadratic global minimization

This page was built for publication: A parallel stochastic method for solving linearly constrained concave global minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200631)