Projections onto the canonical simplex with additional linear inequalities
Luká Adam (adamutia.cas.cz)
Abstract: We consider the distributionally robust optimization and show that computing the distributional worst-case is equivalent to computing the projection onto the canonical simplex with additional linear inequality. We consider several distance functions to measure the distance of distributions. We write the projections as optimization problems and show that they are equivalent to finding a zero of real-valued functions. We prove that these functions possess nice properties such as monotonicity or convexity. We design optimization methods with guaranteed convergence and derive their theoretical complexity. We demonstrate that our methods have (almost) linear observed complexity.
Keywords: Projection; simplex; distributionally robust optimization; linear obseved complexity.
Category 1: Nonlinear Optimization (Quadratic Programming )
Category 2: Robust Optimization
Entry Submitted: 05/09/2019
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|