Saddle point approximation approaches for two-stage robust optimization problems
type: Item
instance of: scholarly article
title: Saddle point approximation approaches for two-stage robust optimization problems
zbMATH Open document ID: 1465.90058
author: Ning Zhang
author: Chang Fang
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 7340614
zbMATH Keywords: two-stage robust optimization
zbMATH Keywords: randomized approach
zbMATH Keywords: piecewise linear decision rule
zbMATH Keywords: saddle point problem
zbMATH Keywords: mirror descent algorithm
MaRDI profile type: Publication
full work available at URL: s10898-019-00836-4
OpenAlex ID: W2979472316
cites work: The robust vehicle routing problem with time windows
cites work: Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
cites work: A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
cites work: Adjustable robust solutions of uncertain linear programs
cites work: On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
cites work: On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
cites work: On the approximability of adjustable robust convex optimization under uncertainty
cites work: A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
cites work: Optimality of Affine Policies in Multistage Robust Optimization
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: The Scenario Approach to Robust Control Design
cites work: On the performance of sparse process structures in partial postponement production systems
cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
cites work: Ambiguous chance constrained problems and robust optimization
cites work: Robust location transportation problems under uncertain demands
cites work: Supermodularity and Affine Policies in Dynamic Robust Optimization
cites work: Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
cites work: Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
cites work: Subgradients of marginal functions in parametric mathematical programming
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: A Characterization of Stability in Linear Programming
cites work: Generalized equations and their solutions, Part I: Basic theory
cites work: Robust Approximation to Multiperiod Inventory Management
cites work: Stochastic Programs with Recourse
cites work: Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
cites work: Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
cites work: A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
cites work: A survey of adjustable robust optimization
Wikidata QID: Q127066716
DOI: 10.1007/S10898-019-00836-4
description: scientific article; zbMATH DE number 7340614