On the maximal singularity-free ellipse of planar 3-RP R parallel mechanisms via convex optimization
Robotics and Computer-Integrated Manufacturing
| Hi-index | 0.00 |
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result generalizes Chebyshev’s inequality for scalar random variables. Two semidefinite programming formulations are presented, with a constructive proof based on convex optimization duality and elementary linear algebra.