Projections onto the canonical simplex with additional linear inequalities
From MaRDI portal
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.
Recommendations
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Two fast algorithms for projecting a point onto the canonical simplex
- Robust optimization problem for linear polyhedral cone constrained distribution on KL-divergence
- scientific article; zbMATH DE number 3924512
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
Cites work
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- A semismooth Newton method with analytical path-following for the H^1-projection onto the Gibbs simplex
- A Simplex Method for Function Minimization
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust SDDP
- Efficient learning of label ranking by soft projections onto polyhedra
- Fast projection onto the simplex and the l₁ ball
- scientific article; zbMATH DE number 2038815 (Why is no real title available?)
- Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
- JuMP: a modeling language for mathematical optimization
- Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets
- Probing the Pareto frontier for basis pursuit solutions
- Validation of subgradient optimization
This page was built for publication: Projections onto the canonical simplex with additional linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038426)
