Stability of \varepsilon-approximate Solutions to Convex Stochastic Programs
From MaRDI portal
Stability of $\varepsilon$-approximate Solutions to Convex Stochastic Programs
Recommendations
- Stability of the optimal solution sets of approximation problems for stochastic programming
- scientific article; zbMATH DE number 4037608
- Stability results for stochastic programming problems
- Stability and approximation of stochastical optimisation problems
- Stability of approximate optimal solutions sets and continuity of optimal values of probabilistic constrained programs
- Stability in \(E\)-convex programming
- scientific article; zbMATH DE number 3956819
- Stability of solutions to chance constrained stochastic programs
- scientific article; zbMATH DE number 3987058
- scientific article; zbMATH DE number 4072718
Cited in
(27)- Scenario reduction for stochastic programs with conditional value-at-risk
- Approximations and solution estimates in optimization
- Problem-based optimal scenario generation and reduction in stochastic programming
- Scenario reduction revisited: fundamental limits and guarantees
- Scenario tree reduction for multistage stochastic programs
- Continuity and stability of two-stage stochastic programs with quadratic continuous recourse
- Hadamard directional differentiability of the optimal value of a linear second-order conic programming problem
- Constructing branching trees of geostatistical simulations
- Stability of solutions to chance constrained stochastic programs
- Consistency of learning algorithms using Attouch-Wets convergence
- Epi‐consistency of convex stochastic programs
- Risk objectives in two-stage stochastic programming models
- Scenario Reduction Techniques in Stochastic Programming
- A polynomial-time solution scheme for quadratic stochastic programs
- Quantitative Stability of Two-Stage Linear Second-Order Conic Stochastic Programs with Full Random Recourse
- Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse
- Quantitative stability of full random two-stage stochastic programs with recourse
- Quantitative stability and empirical approximation of risk-averse models induced by two-stage stochastic programs with full random recourse
- Graphical convergence of subgradients in nonconvex optimization and learning
- Analysis of Stochastic Approximation Schemes With Set-Valued Maps in the Absence of a Stability Guarantee and Their Stabilization
- Quantitative stability of full random two-stage problems with quadratic recourse
- Quantitative stability analysis of two-stage stochastic linear programs with full random recourse
- Variational theory for optimization under stochastic ambiguity
- Stability and continuity in robust optimization
- Data-driven priors in the maximum entropy on the mean method for linear inverse problems
- Rockafellian relaxation for PDE-constrained optimization with distributional ambiguity
- On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. I: Theory
This page was built for publication: Stability of $\varepsilon$-approximate Solutions to Convex Stochastic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519415)