Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
type: Item
instance of: scholarly article
title: Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
zbMATH Open document ID: 1468.90075
author: Yannan Chen
author: Hailin Sun
author: Huifu Xu
published in: Computational Optimization and Applications
publication date: 2021-05-20T00:00:00Z
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7350285
zbMATH Keywords: distributionally robust optimization
zbMATH Keywords: decomposition method
zbMATH Keywords: moment conditions
zbMATH Keywords: Kantorovich ball
zbMATH Keywords: discrete approximation
zbMATH Keywords: parallel computing
describes a project that uses: ROME
MaRDI profile type: Publication
full work available at URL: s10589-020-00234-7
OpenAlex ID: W3097661180
cites work: Measure Theory and Probability Theory
cites work: Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
cites work: A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
cites work: Minimax Theorems
cites work: On Choosing and Bounding Probability Metrics
cites work: Distributionally Robust Optimization and Its Tractable Approximations
cites work: Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint
cites work: Distributionally robust shortfall risk optimization model and its approximation
cites work: Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
cites work: An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
cites work: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
cites work: Risk-Averse Two-Stage Stochastic Program with Distributional Ambiguity
cites work: On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
cites work: Primal-dual hybrid gradient method for distributionally robust optimization problems
cites work: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
cites work: Q5702553
cites work: Multistage Stochastic Optimization
cites work: Ambiguity in portfolio selection
cites work: Q3999495
cites work: Scenarios and Policy Aggregation in Optimization Under Uncertainty
cites work: Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging
cites work: Q4830009
cites work: Decomposition methods in stochastic programming
cites work: Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
cites work: Q3244478
cites work: On a Class of Minimax Stochastic Programs
cites work: Semi-infinite programming. Recent advances
cites work: Quadratic two-stage stochastic optimization with coherent measures of risk
cites work: Convergence analysis for distributionally robust optimization and equilibrium problems
cites work: Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
cites work: Distributionally Robust Convex Optimization
cites work: Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
cites work: Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
cites work: A unified primal-dual algorithm framework based on Bregman iteration
cites work: Q3660600
DOI: 10.1007/S10589-020-00234-7
description: scientific article; zbMATH DE number 7350285