Brief paper: Probabilistic bounds for l1 uncertainty model validation
Automatica (Journal of IFAC)
A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
Mathematics of Operations Research
A semidefinite optimization approach to the steady-state analysis of queueing systems
Queueing Systems: Theory and Applications
Global optimization of robust chance constrained problems
Journal of Global Optimization
Adaptive Web SitesA Knowledge Extraction from Web Data Approach
Proceedings of the 2008 conference on Adaptive Web Sites: A Knowledge Extraction from Web Data Approach
Bounding Probability of Small Deviation: A Fourth Moment Approach
Mathematics of Operations Research
On Markov---Krein characterization of the mean waiting time in M/G/K and other queueing systems
Queueing Systems: Theory and Applications
Theory and Applications of Robust Optimization
SIAM Review
Manifold-Regularized minimax probability machine
PSL'11 Proceedings of the First IAPR TC3 conference on Partially Supervised Learning
Journal of Global Optimization
Stochastic 0-1 linear programming under limited distributional information
Operations Research Letters
Robust portfolio selection with uncertain exit time using worst-case VaR strategy
Operations Research Letters
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters
The submodular knapsack polytope
Discrete Optimization
Robust linear optimization under general norms
Operations Research Letters
The truncated Stieltjes moment problem solved by using kernel density functions
Journal of Computational and Applied Mathematics
Price of Correlations in Stochastic Optimization
Operations Research
Analysis of transient queues with semidefinite optimization
Queueing Systems: Theory and Applications
Multiple Objectives Satisficing Under Uncertainty
Operations Research
Laplacian minimax probability machine
Pattern Recognition Letters
Hi-index | 0.00 |
We propose a semidefinite optimization approach to the problem of deriving tight moment inequalities for $P(X\in S)$, for a set S defined by polynomial inequalities and a random vector X defined on $\Omega\subseteq {\cal R}^n$ that has a given collection of up to kth-order moments. In the univariate case, we provide optimal bounds on $P(X\in S)$, when the first k moments of X are given, as the solution of a semidefinite optimization problem in k + 1 dimensions. In the multivariate case, if the sets S and $\Omega$ are given by polynomial inequalities, we obtain an improving sequence of bounds by solving semidefinite optimization problems of polynomial size in n, for fixed k.We characterize the complexity of the problem of deriving tight moment inequalities. We show that it is NP-hard to find tight bounds for $k\geq 4$ and $\Omega={\cal R}^n$ and for $k\geq 2$ and $\Omega={\cal R}^n_+,$ when the data in the problem is rational. For k = 1 and $\Omega={\cal R}^n_+$ we show that we can find tight upper bounds by solving n convex optimization problems when the set S is convex, and we provide a polynomial time algorithm when S and $\Omega$ are unions of convex sets, over which linear functions can be optimized efficiently. For the case k = 2 and $\Omega={\cal R}^n$, we present an efficient algorithm for finding tight bounds when S is a union of convex sets, over which convex quadratic functions can be optimized efficiently.