Simulation-Based Optimization for Convex Functions Over Discrete Sets

Eunji Lim

International Journal of Statistics and Probability, 2021, vol. 10, issue 5, 31

Abstract: We propose a new iterative algorithm for finding a minimum point of f_*-X \subset \mathbb{R}^d \rightarrow \mathbb{R}, when f_* is known to be convex, but only noisy observations of f_*(\textbf{x}) are available at \textbf{x} \in X for a finite set X. At each iteration of the proposed algorithm, we estimate the probability of each point \textbf{x} \in X being a minimum point of f_* using the fact that f_* is convex, and sample r points from X according to these probabilities. We then make observations at the sampled points and use these observations to update the probability of each point \textbf{x} \in X being a minimum point of f_*. Therefore, the proposed algorithm not only estimates the minimum point of f_* but also provides the probability of each point in X being a minimum point of f_*. Numerical results indicate the proposed algorithm converges to a minimum point of f_* as the number of iterations increases and shows fast convergence, especially in the early stage of the iterations.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/ijsp/article/download/0/0/45794/48719 (application/pdf)
https://ccsenet.org/journal/index.php/ijsp/article/view/0/45794 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:ijspjl:v:10:y:2021:i:5:p:31

Access Statistics for this article

More articles in International Journal of Statistics and Probability from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().