Robust Convex Optimization

Explore this paper's citation graph

Summary

If U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficientalgorithms such as polynomial time interior point methods.

Type
article
Published
1998-11-01
Cited by
2,898
References
16

Keywords

Mathematics, Robust optimization, Semidefinite programming, Mathematical optimization, Quadratically constrained quadratic program

References

Cited by

Related papers