Search Results - approximate statistics (dynamic OR dynamik) programming algorithm*

A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments by Harman, Radoslav, Filová, Lenka, Richtárik, Peter

“…We propose a class of subspace ascent methods for computing optimal approximate designs that covers existing algorithms as well as new and more efficient ones…”
Get full text

An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application by Simao, Hugo P, Day, Jeff, George, Abraham P, Gifford, Ted, Nienow, John, Powell, Warren B

“… The goal of the model was not to obtain a better solution but rather to closely match a number of operational statistics…”
Get full text

Approximate dynamic programming methods in Bayesian preference elicitation by Fisher, William, Zhang, Qiong, Song, Yongjia

“…Bayesian preference elicitation is a statistical framework which can aid in complex decision making processes such as engineering design by offering…”
Get full text

On-Policy and Off-Policy Value Iteration Algorithms for Stochastic Zero-Sum Dynamic Games by Guo, Liangyuan, Wang, Bing-Chang, Zhang, Ji-Feng

“…This paper considers the value iteration algorithms of stochastic zero-sum linear quadratic games with unkown dynamics…”
Get full text

Approximate dynamic programming algorithms for optimal dosage decisions in controlled ovarian hyperstimulation by He, Miao, Zhao, Lei, Powell, Warren B.

“… ► Design efficient approximate dynamic programming (ADP) solution algorithms. ► Compare ADP policies with the Markov decision processes (MDP) benchmark…”
Get full text

An adaptive dynamic programming-based algorithm for infinite-horizon linear quadratic stochastic optimal control problems by Zhang, Heng

“…This paper develops a novel adaptive dynamic programming (ADP)-based model-free policy iteration (PI…”
Get full text

Dynamic programming approximation algorithms for the capacitated lot-sizing problem by Büyüktahtakın, İ. Esra, Liu, Ning

“… The proposed method combines dynamic programming with regression, data fitting, and approximation techniques to estimate the inventory cost function at each stage of the dynamic program…”
Get full text

A Bayesian Machine Learning Approach for Optimizing Dynamic Treatment Regimes by Murray, Thomas A., Yuan, Ying, Thall, Peter F.

“… These decisions can be formalized as a dynamic treatment regime. This article describes a new approach for optimizing dynamic treatment regimes, which bridges the gap between Bayesian inference and existing approaches, like Q-learning…”
Get full text

New efficient algorithms for multiple change-point detection with reproducing kernels by Celisse, A., Marot, G., Pierre-Jean, M., Rigaill, G.J.

“… It is based on an exact optimization algorithm and deals…”
Get full text

Stable iterative adaptive dynamic programming algorithm with approximation errors for discrete-time nonlinear systems by Wei, Qinglai, Liu, Derong

“…In this paper, a novel iterative adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems…”
Get full text

Metropolis-Hastings via Classification by Kaji, Tetsuya, Ročková, Veronika

“…) estimators which can be plugged into the Metropolis-Hastings algorithm. The resulting Markov chains generate, at a steady state, samples from an approximate posterior whose asymptotic properties we characterize…”
Get full text

MIDAS: A mixed integer dynamic approximation scheme by Philpott, A. B., Wahid, F., Bonnans, J. F.

“…Mixed integer dynamic approximation scheme (MIDAS) is a new sampling-based algorithm for solving finite-horizon stochastic dynamic programs with monotonic Bellman functions…”
Get full text

ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH by Bikker, Ingeborg A., Mes, Martijn R.K., Sauré, Antoine, Boucherie, Richard J.

“…We study an online capacity planning problem in which arriving patients require a series of appointments at several departments, within a certain access time…”
Get full text

Multiplicative auction algorithm for approximate maximum weight bipartite matching by Zheng, Da Wei, Henzinger, Monika

“… ) . Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a ( 1 - ε…”
Get full text

Integrated computational intelligent paradigm for nonlinear electric circuit models using neural networks, genetic algorithms and sequential quadratic programming by Mehmood, Ammara, Zameer, Aneela, Ling, Sai Ho, Rehman, Ata ur, Raja, Muhammad Asif Zahoor

“…), global search efficacy of genetic algorithms (GA) and rapid local search with sequential quadratic programming (SQP…”
Get full text

A multi-criteria approach to approximate solution of multiple-choice knapsack problem by Bednarczuk, Ewa M., Miroforidis, Janusz, Pyzel, Przemysław

“…We propose a method for finding approximate solutions to multiple-choice knapsack problems…”
Get full text

Detection of Multiple Structural Breaks in Large Covariance Matrices by Li, Yu-Ning, Li, Degui, Fryzlewicz, Piotr

“…This article studies multiple structural breaks in large contemporaneous covariance matrices of high-dimensional time series satisfying an approximate factor model…”
Get full text

Data mining for state space orthogonalization in adaptive dynamic programming by Ariyajunya, Bancha, Chen, Ying, Chen, Victoria C.P., Kim, Seoung Bum

“…•A case study addresses multicollinearity between ozone pollution concentrations. Dynamic programming (DP…”
Get full text

The ordered k-median problem: surrogate models and approximation algorithms by Aouad, Ali, Segev, Danny

“…) in the ordered list of all coverage distances. While antecedent literature has focused on mathematical properties of ordered median functions, integer programming methods, various heuristics, and special…”
Get full text

Active-set based block coordinate descent algorithm in group LASSO for self-exciting threshold autoregressive model by Nasir, Muhammad Jaffri Mohd, Khan, Ramzan Nazim, Nair, Gopalan, Nur, Darfiana

“… ) algorithm has been applied to obtain an approximate solution to the optimization problem. Although gLAR algorithm is computationally fast, it has been…”
Get full text