We consider optimization problems involving convex risk functions. By employing techniques of convex analysis and optimization theory in vector spaces of measurable functions we d...
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
We show that an interior-pointmethodfor monotonevariationalinequalitiesexhibits superlinear convergence provided that all the standard assumptions hold except for the well-known as...
A discrete-time financial market model is considered with a sequence of investors whose preferences are described by utility functions Un defined on the whole real line. It is s...
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...