Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with... http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png SIAM Journal on Optimization Unpaywall

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L.
SIAM Journal on Optimization – Jan 1, 2020
Download PDF
Loading next page...
 
/lp/unpaywall/sharp-worst-case-evaluation-complexity-bounds-for-arbitrary-order-bE1s0epy9Q

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Unpaywall
ISSN
1052-6234
DOI
10.1137/17m1144854
Publisher site
See Article on Publisher Site

Abstract

Journal

SIAM Journal on Optimization – Unpaywall

Published: Jan 1, 2020

There are no references for this article.