Essential intersection and approximation results for robust optimization
From MaRDI portal
Ergodic theorems, spectral theory, Markov operators (37A30) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Convex functions and convex programs in convex geometry (52A41) Strong limit theorems (60F15) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- On approximate solutions and saddle point theorems for robust convex optimization
- Optimality of robust approximation solutions for uncertain convex optimization problems
- On approximate solutions for robust convex semidefinite optimization problems
- On solution sets for robust optimization problems
- An approximation technique for robust nonlinear optimization
- scientific article; zbMATH DE number 6843801
- Robust convex optimization: a new perspective that unifies and extends
- Robust convex optimization
- Robust Solutions to a General Class of Approximation Problems
- An efficient algorithm for a certain class of robust optimization problems
Cited in
(5)- Conditional interior and conditional closure of random sets
- Ergodic approach to robust optimization and infinite programming problems
- Conditional cores and conditional convex hulls of random sets
- Generic consistency for approximate stochastic programming and statistical problems
- Robust Solutions to a General Class of Approximation Problems
This page was built for publication: Essential intersection and approximation results for robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925036)
