Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
From MaRDI portal
Publication:5870366
DOI10.1287/MOOR.2021.1247OpenAlexW4214599916MaRDI QIDQ5870366FDOQ5870366
Authors: Junyi Liu, Ying Cui, Jong-Shi Pang 
Publication date: 9 January 2023
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14342
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
- Title not available (Why is that?)
- Generalized deviations in risk analysis
- Implicit Functions and Solution Mappings
- Error bounds in mathematical programming
- Lectures on Stochastic Programming
- Title not available (Why is that?)
- Applications of functional analysis and operator theory
- Assessing solution quality in stochastic programs
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
- A robust-CVaR optimization approach with application to breast cancer therapy
- Law of Large Numbers for Random Sets and Allocation Processes
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic optimization using a trust-region method and random models
- Optimality functions in stochastic programming
- Extensions of stochastic optimization results to problems with system failure probability functions
- Statistical verification of optimality conditions for stochastic programs with recourse
- Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
- Variable-sample methods for stochastic optimization
- Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances
- Sample average approximation method for compound stochastic optimization problems
- Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions
- Statistical estimation of composite risk functionals and risk optimization problems
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Strong law of large numbers for Banach space valued random sets
- Maximization of AUC and buffered AUC in binary classification
- Computing B-stationary points of nonsmooth DC programs
- Buffered Probability of Exceedance: Mathematical Properties and Optimization
- Estimation and asymptotics for buffered probability of exceedance
- Stability and error analysis for optimization and generalized equations
- On the pervasiveness of difference-convexity in optimization and statistics
- Composite difference-MAX programs for modern statistical estimation problems
- Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming
- Sample complexity of sample average approximation for conditional stochastic optimization
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- Multilevel stochastic gradient methods for nested composition optimization
- Modern nonconvex nondifferentiable optimization
Cited In (3)
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)
