Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints

Title
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
Authors
Keywords
Global optimization, <span class=EmphasisFontCategoryNonProportional >DISIMPL, <span class=EmphasisFontCategoryNonProportional > DIRECT
Journal
Optimization Letters
Volume 10, Issue 2, Pages 237-246
Publisher
Springer Nature
Online
2014-08-03
DOI
10.1007/s11590-014-0772-4

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Create your own webinar

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

Create Now