An Approximation Scheme for Distributionally Robust Nonlinear Optimization
DOI10.1137/19M1263121zbMath1448.90068OpenAlexW3045847061MaRDI QIDQ5116546
Michael Ulbrich, Johannes Milz
Publication date: 18 August 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1263121
semidefinite programmingrobust optimizationdistributionally robust optimizationsmoothing methodssmoothing functionstrust-region problemgradient consistency
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods based on nonlinear programming (49M37) Robustness in mathematical programming (90C17)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Nonsmooth optimization via quasi-Newton methods
- Gradient consistency for integral-convolution smoothing functions
- Epi-convergence properties of smoothing by infimal convolution
- Algorithms with adaptive smoothing for finite minimax problems
- Moment inequalities for sums of random matrices and their applications in optimization
- A feasible direction method for the semidefinite program with box constraints
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing technique and its applications in semidefinite optimization
- General robust-optimization formulation for nonlinear programming
- On analyticity of functions involving eigenvalues
- Nonsmooth analysis of eigenvalues
- Robust solutions of linear programming problems contaminated with uncertain data
- Smooth convex approximation to the maximum eigenvalue function
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- Approximate KKT points and a proximity measure for termination
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Nonlinear robust optimization via sequential convex bilevel programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An approximation technique for robust nonlinear optimization
- Deriving robust counterparts of nonlinear uncertain inequalities
- Sensitivity and stability analysis for nonlinear programming
- Lectures on Modern Convex Optimization
- Epi-convergent Smoothing with Applications to Convex Composite Functions
- Comparing different nonsmooth minimization methods and software
- Nonconvex Robust Optimization for Problems with Constraints
- Distributionally Robust Convex Optimization
- Julia: A Fresh Approach to Numerical Computing
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- Robust Optimization for Unconstrained Simulation-Based Problems
- Theory and Applications of Robust Optimization
- Computing a Trust Region Step
- Testing Unconstrained Optimization Software
- Newton’s Method with a Model Trust Region Modification
- Generalized Gradients and Applications
- Algorithm 984
- Distributionally Robust Stochastic Programming
- Minimax analysis of stochastic problems
- Derivatives of Spectral Functions
- Interior Methods for Nonlinear Optimization
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations
- A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Point-to-Set Maps in Mathematical Programming
- On sequential optimality conditions for smooth constrained optimization