On robustness in nonconvex optimization with application to defense planning

DOI10.1016/J.ORL.2022.11.003zbMATH Open1525.90341arXiv2208.09725MaRDI QIDQ6161271FDOQ6161271

Authors: Johannes O. Royset 

Publication date: 27 June 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Abstract: In the context of structured nonconvex optimization, we estimate the increase in minimum value for a decision that is robust to parameter perturbations as compared to the value of a nominal problem. The estimates rely on detailed expressions for subgradients and local Lipschitz moduli of min-value functions in nonconvex robust optimization and require only the solution of the nominal problem. The theoretical results are illustrated by examples from military operations research involving mixed-integer optimization models. Across 54 cases examined, the median error in estimating the increase in minimum value is 12%. Therefore, the derived expressions for subgradients and local Lipschitz moduli may accurately inform analysts about the possibility of obtaining cost-effective, parameter-robust decisions in nonconvex optimization.

Full work available at URL: https://arxiv.org/abs/2208.09725

Recommendations

• Nonconvex robust programming via value-function optimization
• General robust-optimization formulation for nonlinear programming
• Nonconvex robust optimization for problems with constraints
• Robust convex optimization
• Robust optimization for non-linear impact of data variation

zbMATH Keywords

sensitivity analysisnonconvex optimizationrobustnessmilitary operations research

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Robustness in mathematical programming (90C17)

Cites Work

• Variational Analysis
• Optimization. Algorithms and consistent approximations
• Stochastic finance. An introduction in discrete time.
• Theory and applications of robust optimization
• Robust optimization
• The Price of Robustness
• Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
• Optimal search for moving targets
• Data-driven robust optimization
• Robust stochastic facility location: sensitivity analysis and exact solution
• Distributionally Robust Convex Optimization
• Variational analysis and applications
• Modeling uncertainty of expert elicitation for use in risk-based optimization
• Variational theory for optimization under stochastic ambiguity
• Pyomo -- optimization modeling in Python
• Measures of Residual Risk with Connections to Regression, Risk Tracking, Surrogate Models, and Ambiguity
• An Optimization Primer
• A survey of network interdiction models and algorithms
• Stability analysis for parameterized variational systems with implicit constraints
• Optimizing the US Navy's combat logistics force
• Scheduling combat logistics force replenishments at sea for the US Navy

This page was built for publication: On robustness in nonconvex optimization with application to defense planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161271)