Stochastic Cutting Planes for Data-Driven Optimization
From MaRDI portal
Recommendations
- Stochastic dynamic cutting plane for multistage stochastic convex programs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- A cutting plane method from analytic centers for stochastic programming
- Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
Cites work
- A General Stochastic Outer Approximations Method
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximate cutting planes in nonlinear programming
- Concentration inequalities for sampling without replacement
- Endogeneity in Semiparametric Binary Response Models
- Limited information estimators and exogeneity tests for simultaneous probit models
- Mixed integer programming: analyzing 12 years of progress
- Optimized cutting plane algorithm for large-scale risk minimization
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Solving mixed integer nonlinear programs by outer approximation
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- The sample average approximation method for stochastic discrete optimization
- Uncertain convex programs: randomized solutions and confidence levels
This page was built for publication: Stochastic Cutting Planes for Data-Driven Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057985)
