The empirical behavior of sampling methods for stochastic programming
From MaRDI portal
Publication:2507414
DOI10.1007/s10479-006-6169-8zbMath1122.90391OpenAlexW2000257769WikidataQ105583406 ScholiaQ105583406MaRDI QIDQ2507414
Jeff Linderoth, Stephen J. Wright, Alexander Shapiro
Publication date: 11 October 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-6169-8
Monte Carlo samplingcomputational gridrecoursesample average approximationsstochastic linear programmingoptimality gapstatistical KKT test
Related Items
Optimal path problems with second-order stochastic dominance constraints, Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage, Statistical estimation of operating reserve requirements using rolling horizon stochastic optimization, Predictive stochastic programming, The effect of regularization in portfolio selection problems, Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation, Clustering-based preconditioning for stochastic programs, Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming, Kernel Entropy Discriminant Analysis for Dimension Reduction, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study, Scenario Min-Max Optimization and the Risk of Empirical Costs, On sample size control in sample average approximations for solving smooth stochastic programs, SAMPLE AVERAGE APPROXIMATION METHOD FOR SOLVING A DETERMINISTIC FORMULATION FOR BOX CONSTRAINED STOCHASTIC VARIATIONAL INEQUALITY PROBLEMS, An empirical analysis of scenario generation methods for stochastic optimization, Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS, Reformulation and sampling to solve a stochastic network interdiction problem, Stochastic optimization using a trust-region method and random models, SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization, The value and cost of more stages in stochastic programing: a statistical analysis on a set of portfolio choice problems, Scenario reduction for stochastic programs with conditional value-at-risk, An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization, Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach, Vehicle routing with probabilistic capacity constraints, Stochastic multi-site capacity planning of TFT-LCD manufacturing using expected shadow-price based decomposition, Stochastic Nash equilibrium problems: sample average approximation and applications, A multistage stochastic programming asset-liability management model: an application to the Brazilian pension fund industry, Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel, Surgery Sequencing Coordination with Recovery Resource Constraints, General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension, An ADMM algorithm for two-stage stochastic programming problems, Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities, A smoothing SAA method for a stochastic mathematical program with complementarity constraints., Approximate stochastic dynamic programming for hydroelectric production planning, Dynamic fleet scheduling with uncertain demand and customer flexibility, On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty, Learning regularization parameters for general-form Tikhonov, Efficient Stochastic Programming in Julia, Confidence-based reasoning in stochastic constraint programming, Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction, Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation, Approximation Algorithms for Stochastic and Risk-Averse Optimization, Computational study of decomposition algorithms for mean-risk stochastic linear programs, On the convergence of coderivative of SAA solution mapping for a parametric stochastic generalized equation, Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation, On the convergence of coderivative of SAA solution mapping for a parametric stochastic variational inequality, On Feasibility of Sample Average Approximation Solutions, An optimal method for stochastic composite optimization, The impact of sampling methods on bias and variance in stochastic linear programs, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Integrated supply chain planning under uncertainty using an improved stochastic approach, Simulation-based confidence bounds for two-stage stochastic programs, A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming, Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion, Stochastic dual dynamic programming applied to nonconvex hydrothermal models, A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints, Multicut Benders decomposition algorithm for process supply chain planning under uncertainty, Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse, An efficient linear programming based method for the influence maximization problem in social networks, A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs, Simulation-Based Optimality Tests for Stochastic Programs, Generalized conditioning based approaches to computing confidence intervals for solutions to stochastic variational inequalities, Efficient solution selection for two-stage stochastic programs, A Central Limit Theorem and Hypotheses Testing for Risk-averse Stochastic Programs, Uncertainty feature optimization: An implicit paradigm for problems with noisy data, Variance reduction for sequential sampling in stochastic programming, A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, The stratified \(p\)-center problem, A stochastic programming approach for supply chain network design under uncertainty, Climate change and optimal energy technology R\&D policy, Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming, Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space, Sales and operations planning in systems with order configuration uncertainty, Validation analysis of mirror descent stochastic approximation method, Some large deviations results for Latin hypercube sampling, Topological optimization of reliable networks under dependent failures, Regularized optimization with spatial coupling for robust decision making, Hierarchical MPC schemes for periodic systems using stochastic programming, Some insights into the solution algorithms for SLP problems, Underground mine scheduling under uncertainty, Stochastic programming approach to optimization under uncertainty, Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation, Stochastic polynomial optimization, Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications, Challenges in Enterprise Wide Optimization for the Process Industries, Robust improvement schemes for road networks under demand uncertainty, Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty, Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients, An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse, Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support, Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse, On complexity of multistage stochastic programs, A smooth penalty-based sample average approximation method for stochastic complementarity problems, Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method, Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure, Risk and complexity in scenario optimization, Two-stage linear decision rules for multi-stage stochastic programming, Periodic supply vessel planning under demand and weather uncertainty, Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Non-parametric generalised newsvendor model, The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs, Sample average approximation for risk-averse problems: a virtual power plant scheduling application, A stochastic optimization approach for staff scheduling decisions at inpatient units, Block mirror stochastic gradient method for stochastic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- 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
- Sample-path optimization of convex stochastic performance functions
- Duality and statistical tests of optimality for two stage stochastic programs
- Conditioning of convex piecewise linear stochastic programs
- Solving large quadratic assignment problems on computational grids
- Solving large MINLPs on computational grids
- Decomposition algorithms for stochastic programming on a computational grid
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- An Efficient Sampling Technique for Off-Line Quality Control
- Monte Carlo Variance of Scrambled Net Quadrature
- Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Integrated Variance Reduction Strategies for Simulation
- Convex Analysis
- FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver