Pages that link to "Item:Q1248264"
From MaRDI portal
The following pages link to Stochastic approximation methods for constrained and unconstrained systems (Q1248264):
Displayed 50 items.
- Adaptive algorithms for first principal eigenvector computation (Q557636) (← links)
- Monte Carlo algorithms for optimal stopping and statistical learning (Q558680) (← links)
- Convergence theorems for the Kohonen feature mapping algorithms with VLRPs (Q679276) (← links)
- Generalized surrogate problem methodology for online stochastic discrete optimization (Q700765) (← links)
- Adaptation and tracking in system identification - a survey (Q751601) (← links)
- Non-asymptotic confidence bounds for stochastic approximation algorithms with constant step size (Q753365) (← links)
- Topological orbital equivalence with asymptotic phase for a two time- scales discrete-time system (Q753756) (← links)
- Theory and applications of adaptive control - a survey (Q792938) (← links)
- Stochastic programming in water management: A case study and a comparison of solution techniques (Q803039) (← links)
- Simulated annealing type algorithms for multivariate optimization (Q810383) (← links)
- Learning in linear models with expectational leads (Q859604) (← links)
- Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithms (Q862224) (← links)
- Almost sure convergence of Titterington's recursive estimator for mixture models (Q866603) (← links)
- A simulation optimization method that considers uncertainty and multiple performance measures (Q872272) (← links)
- Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions (Q910820) (← links)
- Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysis (Q913759) (← links)
- A case study of an adaptive load balancing algorithm (Q919980) (← links)
- Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions (Q952845) (← links)
- Nondifferential optimization via adaptive smoothing (Q1053985) (← links)
- Asymptotic normality of the continuous-time stochastic approximation algorithm (Q1067332) (← links)
- On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix (Q1069252) (← links)
- Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas decroissant (Q1073522) (← links)
- Asymptotic behavior of constrained stochastic approximations via the theory of large deviations (Q1080265) (← links)
- Inventory models under uncertainty: An adaptive approach (Q1080355) (← links)
- On convergence of the stochastic subgradient method with on-line stepsize rules (Q1083369) (← links)
- An algorithm with randomly varying truncation for adaptive beam-formers (Q1084780) (← links)
- Approximation of the initial reserve for known ruin probabilities (Q1089712) (← links)
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds (Q1095544) (← links)
- A combined algorithm for identification and approximation (Q1099561) (← links)
- Strong consistency of recursive identification by no use of persistent excitation condition (Q1100177) (← links)
- Minimizing noisy functionals in Hilbert space: An extension of the Kiefer-Wolfowitz procedure (Q1103307) (← links)
- Optimization of discrete variable stochastic systems by computer simulation (Q1103526) (← links)
- Adaptive filters with constraints and correlated non-stationary signals (Q1103577) (← links)
- On the choice of step size in the Robbins-Monro procedure (Q1110965) (← links)
- On a proof of Robbins-Monro algorithm (Q1117842) (← links)
- Convergence of least squares learning mechanisms in self-referential linear stochastic models (Q1120451) (← links)
- Abstract stochastic approximations and applications (Q1122911) (← links)
- A simplified neuron model as a principal component analyzer (Q1166458) (← links)
- Stochastic approximation with dependent noise (Q1169996) (← links)
- Stochastic quasigradient methods for optimization of discrete event systems (Q1207835) (← links)
- Gradient estimates for the performance of Markov chains and discrete event processes (Q1207844) (← links)
- Analysis of an identification algorithm arising in the adaptive estimation of Markov chains (Q1262282) (← links)
- A stopping rule for the Robbins-Monro method (Q1263202) (← links)
- Sharp convergence rates of stochastic approximation for degenerate roots (Q1267748) (← links)
- Nonparametric adaptive learning with feedback (Q1270759) (← links)
- Stochastic gradient algorithm with random truncations (Q1278958) (← links)
- Stochastic approximation algorithms with constant step size whose average is cooperative (Q1296595) (← links)
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing (Q1296615) (← links)
- Asymptotic behavior of self-organizing maps with nonuniform stimuli distribution (Q1296630) (← links)
- Dynamical systems and variational inequalities (Q1308651) (← links)