On sample size control in sample average approximations for solving smooth stochastic programs
From MaRDI portal
Publication:2376122
DOI10.1007/s10589-012-9528-1zbMath1288.90057MaRDI QIDQ2376122
Publication date: 26 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9528-1
90C15: Stochastic programming
Related Items
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors, Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs, Diametrical risk minimization: theory and computations, An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet, Optimality functions and lopsided convergence, Iteratively sampling scheme for stochastic optimization with variable number sample path, Non-indexability of the stochastic appointment scheduling problem, Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints
Uses Software
Cites Work
- On solving large-scale finite minimax problems using exponential smoothing
- Algorithms with adaptive smoothing for finite minimax problems
- Optimality functions in stochastic programming
- Implementable algorithm for stochastic optimization using sample average approximations
- An adaptive Monte Carlo algorithm for computing mixed logit estimators
- Efficient sample sizes in stochastic nonlinear programming
- Variable-number sample-path optimization
- Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
- The interacting-particle algorithm with dynamic heating and cooling
- Asymptotic analysis of stochastic programs
- A simulation-based approach to two-stage stochastic programming with recourse
- A branch and bound method for stochastic global optimization
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Optimization. Algorithms and consistent approximations
- Stochastic linear programming. Models, theory, and computation
- The sample average approximation method applied to stochastic routing problems: a computational study
- Extensions of stochastic optimization results to problems with system failure probability functions
- Optimization of algorithmic parameters using a meta-control approach
- The empirical behavior of sampling methods for stochastic programming
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
- Finding Optimal Material Release Times Using Simulation-Based Optimization
- A Sequential Sampling Procedure for Stochastic Programming
- A Model Reference Adaptive Search Method for Global Optimization
- Effective diagonalization strategies for the solution of a class of optimal design problems
- Lectures on Stochastic Programming
- Robust Stochastic Approximation Approach to Stochastic Programming
- Introduction to Stochastic Search and Optimization
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- Variable-sample methods for stochastic optimization
- Convergence Analysis of Stochastic Algorithms
- Consistent Approximations and Approximate Functions and Gradients in Optimal Control
- Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
- Neuro-Dynamic Programming: An Overview and Recent Results
- Smoothing method for minimax problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
