Direct search and stochastic optimization applied to two nonconvex nonsmooth problems

David R. Easterling,Layne T. Watson,Michael L. Madigan,Brent S. Castle,Michael W. Trosset

Proceedings of the 2012 Symposium on High Performance Computing（2012）

引用 24|浏览8

暂无评分

摘要

The optimization of two problems with high dimensionality and many local minima are investigated under two different optimization algorithms: DIRECT and QNSTOP, a new algorithm developed at Indiana University.

查看译文

关键词

stochastic optimization,nonconvex nonsmooth problem,indiana university,different optimization algorithm,direct search,new algorithm,local minimum,high dimensionality

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要