Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A primal–dual algorithm for risk minimization

Journal Article · · Mathematical Programming

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA); USDOE Laboratory Directed Research and Development (LDRD) Program; Defense Advanced Research Projects Agency (DARPA); US Air Force Office of Scientific Research (AFOSR); German Research Foundation (DFG)
Grant/Contract Number:
AC04-94AL85000; NA0003525
OSTI ID:
1765742
Report Number(s):
SAND--2021-0818J; 693611
Journal Information:
Mathematical Programming, Journal Name: Mathematical Programming Journal Issue: 1 Vol. 193; ISSN 0025-5610
Publisher:
SpringerCopyright Statement
Country of Publication:
United States
Language:
English

References (31)

Scenarios and Policy Aggregation in Optimization Under Uncertainty journal February 1991
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming journal May 1976
Monotone Operators and the Proximal Point Algorithm journal August 1976
Coherent Measures of Risk journal July 1999
Higher moment coherent risk measures journal August 2007
Epi-Regularization of Risk Measures journal May 2020
Polyhedral Risk Measures in Stochastic Programming journal January 2005
On the maximal monotonicity of subdifferential mappings journal January 1970
stochastic quasigradient methods and their application to system optimization journal January 1983
A Multilevel Stochastic Collocation Algorithm for Optimization of PDEs with Uncertain Coefficients journal January 2014
Nonlinear stochastic programming by Monte-Carlo estimators journal March 2002
An Old-New Concept of Convex risk Measures: the Optimized Certainty Equivalent journal July 2007
Existence and Optimality Conditions for Risk-Averse PDE-Constrained Optimization journal January 2018
On general minimax theorems journal January 1958
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results journal February 1992
Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures journal August 2016
A Trust-Region Algorithm with Adaptive Stochastic Collocation for PDE Optimization under Uncertainty journal January 2013
Convex Analysis and Monotone Operator Theory in Hilbert Spaces book December 2013
Risk-Averse PDE-Constrained Optimization Using the Conditional Value-At-Risk journal January 2016
Path-following Methods for a Class of Constrained Minimization Problems in Function Space journal January 2006
Multiplier and gradient methods journal November 1969
Inexact Objective Function Evaluations in a Trust-Region Algorithm for PDE-Constrained Optimization under Uncertainty journal January 2014
Sampling-Based Decomposition Methods for Multistage Stochastic Programs Based on Extended Polyhedral Risk Measures journal January 2012
Newton's Method for Large Bound-Constrained Optimization Problems journal January 1999
Robust Stochastic Approximation Approach to Stochastic Programming journal January 2009
Variational Analysis book January 1998
Acceleration of Stochastic Approximation by Averaging journal July 1992
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods journal January 2009
Trust Region Methods book January 2000
Dual characterization of properties of risk measures on Orlicz hearts journal July 2008
Validation analysis of mirror descent stochastic approximation method journal February 2011

Similar Records

A globally convergent LCL method for nonlinear optimization.
Journal Article · 2005 · SIAM J. Optimization · OSTI ID:961174

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems
Journal Article · 2022 · SIAM Journal on Control and Optimization · OSTI ID:1884801

A direct nonlinear predictor-corrector primal-dual interior point algorithm for optimal power flows
Journal Article · 1994 · IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States) · OSTI ID:7154120