Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93911
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | en_US |
dc.creator | Chen, X | en_US |
dc.creator | Kelley, CT | en_US |
dc.creator | Xu, F | en_US |
dc.creator | Zhang, Z | en_US |
dc.date.accessioned | 2022-08-03T01:24:10Z | - |
dc.date.available | 2022-08-03T01:24:10Z | - |
dc.identifier.issn | 1064-8275 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/93911 | - |
dc.language.iso | en | en_US |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.rights | © 2018 Society for Industrial and Applied Mathematics | en_US |
dc.rights | The following publication Chen, X., Kelley, C. T., Xu, F., & Zhang, Z. (2018). A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization. SIAM Journal on Scientific Computing, 40(4), A2174-A2199 is available at https://doi.org/10.1137/17M1116714 | en_US |
dc.subject | Clarke stationarity | en_US |
dc.subject | Direct search algorithm | en_US |
dc.subject | Monte Carlo simulation | en_US |
dc.subject | Nonsmooth optimization | en_US |
dc.subject | Sampling methods | en_US |
dc.subject | Smoothing functions | en_US |
dc.title | A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | A2174 | en_US |
dc.identifier.epage | A2199 | en_US |
dc.identifier.volume | 40 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1137/17M1116714 | en_US |
dcterms.abstract | We propose and analyze a smoothing direct search algorithm for finding a minimizer of a nonsmooth nonconvex function over a box constraint set, where the objective function values cannot be computed directly but are approximated by Monte Carlo simulation. In the algorithm, we adjust the stencil size, the sample size, and the smoothing parameter simultaneously so that the stencil size goes to zero faster than the smoothing parameter and the square root of the sample size goes to infinity faster than the reciprocal of the stencil size. We prove that with probability one any accumulation point of the sequence generated by the algorithm is a Clarke stationary point. We report on numerical results from statistics and financial applications. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | SIAM journal on scientific computing, 2018, v. 40, no. 4, p. A2174-A2199 | en_US |
dcterms.isPartOf | SIAM journal on scientific computing | en_US |
dcterms.issued | 2018 | - |
dc.identifier.scopus | 2-s2.0-85053790562 | - |
dc.identifier.eissn | 1095-7197 | en_US |
dc.description.validate | 202208 bcfc | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | AMA-0422 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 13235464 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
17m1116714.pdf | 469.67 kB | Adobe PDF | View/Open |
Page views
52
Last Week
1
1
Last month
Citations as of May 12, 2024
Downloads
40
Citations as of May 12, 2024
SCOPUSTM
Citations
9
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
8
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.