  


Models and Algorithms for Distributionally Robust Least Squares Problems
Sanjay Mehrotra(mehrotraiems.northwestern.edu) Abstract: We present different robust frameworks using probabilistic ambiguity descriptions of the input data in the least squares problems. The three probability ambiguity descriptions are given by: (1) confidence interval over the first two moments; (2) bounds on the probability measure with moments constraints; (3) confidence interval over the probability measure by using the Kantorovich probability distance. For these three cases we derive equivalent formulations and show that the resulting optimization problem can be solved efficiently. Keywords: Robust Optimization, Least Squares, Semidefinite Programming Category 1: Robust Optimization Category 2: Linear, Cone and Semidefinite Programming (SecondOrder Cone Programming ) Category 3: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Download: [PDF] Entry Submitted: 02/15/2011 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  