Sciweavers

377 search results - page 13 / 76
» Convergence of Stochastic Iterative Dynamic Programming Algo...
Sort
View
NIPS
1993
13 years 9 months ago
Optimal Stochastic Search and Adaptive Momentum
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
Todd K. Leen, Genevieve B. Orr
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 2 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 6 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
ANOR
2006
69views more  ANOR 2006»
13 years 7 months ago
A splitting method for stochastic programs
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...
Teemu Pennanen, Markku Kallio
CCE
2004
13 years 7 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff