Duality gaps in nonconvex stochastic optimization

DOI10.1007/S10107-003-0496-1zbMath1073.90025OpenAlexW2007502743MaRDI QIDQ1764248

Werner Römisch, Dentcheva, Darinka

Publication date: 24 February 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0496-1

zbMATH Keywords

stochastic programminginteger programmingLagrangian relaxationdecompositionduality gapnonconvex optimization

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Stochastic programming (90C15)

Related Items (13)

Decomposition algorithm for large-scale two-stage unit-commitment ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ A two-stage stochastic mixed-integer programming approach to the index tracking problem ⋮ Decomposition strategy for the stochastic pooling problem ⋮ A branch-and-bound method for multistage stochastic integer programs with risk objectives ⋮ Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning ⋮ Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs ⋮ Risk Aversion in Two-Stage Stochastic Integer Programming ⋮ Short-term hydropower production planning by stochastic programming ⋮ Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs ⋮ Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems ⋮ Towards strong duality in integer programming ⋮ Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and optimality in multistage stochastic programming
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Dual decomposition in stochastic integer programming
• Decomposition methods in stochastic programming
• Decomposition of test sets in stochastic integer programming
• On augmented Lagrangian decomposition methods for multistage stochastic programs
• Stochastic programming approaches to stochastic scheduling
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
• A regularized decomposition method for minimizing a sum of polyhedral functions
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Estimates of the Duality Gap in Nonconvex Optimization
• The Optimal Recourse Problem in Discrete Time: $L^1 $-Multipliers for Inequality Constraints
• Introduction to Stochastic Programming
• Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
• Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
• A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
• On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
• Lagrange Multipliers and Nonconvex Programs
• Duality gaps in stochastic integer programming
• Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty
• A geometric study of dual gaps, with applications
• Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners

This page was built for publication: Duality gaps in nonconvex stochastic optimization