Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
From MaRDI portal
Publication:5870366
Recommendations
- Sample average approximation method for compound stochastic optimization problems
- On solving multistage stochastic programs with coherent risk measures
- Sampling-based decomposition methods for multistage stochastic programs based on extended polyhedral risk measures
- On a Class of Minimax Stochastic Programs
- Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- A robust-CVaR optimization approach with application to breast cancer therapy
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
- Applications of functional analysis and operator theory
- Assessing solution quality in stochastic programs
- Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming
- Buffered Probability of Exceedance: Mathematical Properties and Optimization
- Composite difference-MAX programs for modern statistical estimation problems
- Computing B-stationary points of nonsmooth DC programs
- Error bounds in mathematical programming
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Estimation and asymptotics for buffered probability of exceedance
- Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
- Extensions of stochastic optimization results to problems with system failure probability functions
- Generalized deviations in risk analysis
- Implicit Functions and Solution Mappings
- Law of Large Numbers for Random Sets and Allocation Processes
- Lectures on Stochastic Programming
- Maximization of AUC and buffered AUC in binary classification
- Modern nonconvex nondifferentiable optimization
- Multilevel stochastic gradient methods for nested composition optimization
- On the pervasiveness of difference-convexity in optimization and statistics
- Optimality functions in stochastic programming
- Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances
- Sample average approximation method for compound stochastic optimization problems
- Sample complexity of sample average approximation for conditional stochastic optimization
- Stability and error analysis for optimization and generalized equations
- Statistical estimation of composite risk functionals and risk optimization problems
- Statistical verification of optimality conditions for stochastic programs with recourse
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Stochastic optimization using a trust-region method and random models
- Strong law of large numbers for Banach space valued random sets
- Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions
- Variable-sample methods for stochastic optimization
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Cited in
(4)- scientific article; zbMATH DE number 6276223 (Why is no real title available?)
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- Risk management in portfolio applications of non-convex stochastic programming
- Solving Nonsmooth Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
This page was built for publication: Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870366)