NPSA: Nonparametric Simulated Annealing for Global Optimization

01/30/2023
by   Rong Chen, et al.
0

In this paper we describe NPSA, the first parallel nonparametric global maximum likelihood optimization algorithm using simulated annealing (SA). Unlike the nonparametric adaptive grid search method NPAG, which is not guaranteed to find a global optimum solution, and may suffer from the curse of dimensionality, NPSA is a global optimizer and it is free from these grid related issues. We illustrate NPSA by a number of examples including a pharmacokinetics (PK) model for Voriconazole and show that NPSA may be taken as an upgrade to the current grid search based nonparametric methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/16/2019

Search Algorithms for Mastermind

his paper presents two novel approaches to solving the classic board gam...
research
01/30/2019

An approximate Itô-SDE based simulated annealing algorithm for multivariate design optimization problems

This research concerns design optimization problems involving numerous d...
research
02/08/2023

Adaptive State-Dependent Diffusion for Derivative-Free Optimization

This paper develops and analyzes a stochastic derivative-free optimizati...
research
02/06/2023

Unified Software Design Patterns for Simulated Annealing

Any optimization algorithm programming interface can be seen as a black-...
research
03/06/2013

A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing

We have developed a general Bayesian algorithm for determining the coord...
research
03/01/2017

Convergence rate of a simulated annealing algorithm with noisy observations

In this paper we propose a modified version of the simulated annealing a...

Please sign up or login with your details

Forgot password? Click here to reset