A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions
From MaRDI portal
Publication:6188504
DOI10.1137/22m1488533arXiv2204.01269OpenAlexW4391029696MaRDI QIDQ6188504
No author found.
Publication date: 7 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.01269
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions
- Fast Moreau envelope computation I: Numerical algorithms
- Partitioning procedures for solving mixed-variables programming problems
- A strong law of large numbers for random compact sets
- A class of stochastic programs with decision dependent random elements
- Decomposition methods in stochastic programming
- Lagrangean relaxation. (With comments and rejoinder).
- Scenario analysis via bundle decomposition
- Decision-dependent probabilities in stochastic programs with recourse
- Inexact stochastic mirror descent for two-stage nonlinear stochastic programs
- Two-stage stochastic standard quadratic optimization
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Stochastic subgradient method converges on tame functions
- Piecewise affine parameterized value-function based bilevel non-cooperative games
- Proximal mappings and Moreau envelopes of single-variable convex piecewise cubic functions and multivariable gauge functions
- Extensions of stochastic optimization results to problems with system failure probability functions
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A class of stochastic programs with decision dependent uncertainty
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Stochastic Network Interdiction
- Introduction to Stochastic Programming
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Robust Stochastic Approximation Approach to Stochastic Programming
- Generalized Gradients and Applications
- Variable-sample methods for stochastic optimization
- Optimization under Decision-Dependent Uncertainty
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- Modern Nonconvex Nondifferentiable Optimization
- Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems
- Lectures on Stochastic Programming: Modeling and Theory, Third Edition
- Sample Average Approximation Method for Compound Stochastic Optimization Problems
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Convex Analysis
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Shorter Notes: Differentiability of the Metric Projection in Finite- Dimensional Euclidean Space
- A Stochastic Approximation Method
- Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs
This page was built for publication: A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions
