Bibliographic Details
| Title: |
MANIFOLD SAMPLING FOR OPTIMIZING NONSMOOTH NONCONVEX COMPOSITIONS. |
| Authors: |
LARSON, JEFFREY, MENICKELLY, MATT, BAOYU ZHOU |
| Source: |
SIAM Journal on Optimization; 2021, Vol. 31 Issue 4, p2638-2664, 27p |
| Subject Terms: |
NONSMOOTH optimization, MATHEMATICAL optimization |
| Abstract: |
We propose a manifold sampling algorithm for minimizing a nonsmooth composition f = h \circ F, where we assume h is nonsmooth and may be inexpensively computed in closed form and F is smooth but its Jacobian may not be available. We additionally assume that the composition h \circ F defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of F are combined with particularly sampled information about h to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about f. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Optimization is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
