Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
DOI10.1007/s10107-017-1143-6zbMath1391.90449OpenAlexW2606883349WikidataQ59526032 ScholiaQ59526032MaRDI QIDQ1646571
Huifu Xu, Hailin Sun, Yong-Chao Liu
Publication date: 25 June 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1143-6
strong dualitycutting plane methodsrandom discretizationlower semicontinuity conditionsmatrix moment constraintsSlater type conditions
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Stochastic programming (90C15)
Related Items (31)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Moment inequalities for sums of random matrices and their applications in optimization
- Robust resource allocations in temporal networks
- Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
- Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
- Robust optimization - a comprehensive survey
- Uncertain convex programs: randomized solutions and confidence levels
- Scenario reduction algorithms in stochastic programming
- Distributionally robust joint chance constraints with second-order moment information
- Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems
- Quantitative Stability Analysis for Distributionally Robust Optimization with Moment Constraints
- Multistage Stochastic Optimization
- Distributionally Robust Convex Optimization
- Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- Uncertainties in minimax stochastic programs
- Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
- The Cutting-Plane Method for Solving Convex Programs
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- Lectures on Stochastic Programming
- Optimization and nonsmooth analysis
- Duality gaps in semi-infinite linear programming—an approximation problem
- Variational Analysis
- Robust Truss Topology Design via Semidefinite Programming
- Monte Carlo sampling approach to stochastic programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- On a Class of Minimax Stochastic Programs
- Robust Markov Decision Processes
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Fatou's Lemma for Weakly Converging Probabilities
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Ambiguity in portfolio selection
- Measure Theory and Probability Theory
- Robust Portfolio Selection Problems
- Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint
- Distributionally Robust Reward-Risk Ratio Optimization with Moment Constraints
- A Survey of the S-Lemma
- Distributionally robust chance constraints for non-linear uncertainties
This page was built for publication: Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods