Mathematics of Operations Research, Vol. 31, No. 3 (Aug., 2006), pp. 433-452 (20 pages) We consider optimization problems involving convex risk functions. By employing techniques of convex analysis ...
Abstract: Many-task optimization typically assumes that all data is available on a single device without taking into account privacy concerns. Federated many-task optimization, which involves using ...
Abstract: Polygonal collision avoidance (PCA) is short for the problem of collision avoidance between two polygons (i.e., polytopes in planar) that own their dynamic equations. This problem suffers ...