Given a finite set of weighted points in Rd (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is ...

Given disjoint finite point sets R and B in the plane, where the elements of R are colored red and the elements of B are colored blue, the maximum box problem asks for an axis-aligned rectangle (i.e. box) containing the ...

In robotics and computer vision, point set registration is necessary in many tasks, for example in estimating the motion of a sensor/sensors between subsequent scans containing point/feature sets. Currently, the Iterated ...

This paper concerns the solution of a convex optimization problem through the saddle point gradient dynamics. Instead of using the standard Lagrangian as is classical in this method, we consider a regularized Lagrangian ...