Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints

标题
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
作者
关键词
Global optimization, <span class=EmphasisFontCategoryNonProportional >DISIMPL, <span class=EmphasisFontCategoryNonProportional > DIRECT
出版物
Optimization Letters
Volume 10, Issue 2, Pages 237-246
出版商
Springer Nature
发表日期
2014-08-03
DOI
10.1007/s11590-014-0772-4

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started