Optimization of caching devices with geometric constraints

Optimization of Caching Devices with Geometric Constraints

It has been recently advocated that in large communication systems it is beneficial both for the users and for the network as a whole to store content closer to users. One particular implementation of such an approach is to co-locate caches with wireless base stations. In this paper we study geographically distributed caching of a fixed collection of files. We model cache placement with the hel...

Stochastic geometric optimization with joint probabilistic constraints

This paper discusses geometric programs with joint probabilistic constraints. When the stochastic parameters are normally distributed and independent of each other, we approximate the problem by using piecewise polynomial functions with non-negative coefficients, and transform the approximation problem into a convex geometric program. We prove that this approximation method provides a lower bou...

Geometric optimization of hydrodynamically cavitating devices

Moreau-Yosida regularization in shape optimization with geometric constraints

In the context of shape optimization with geometric constraints we employ the method of mappings (perturbation of identity) to obtain an optimal control problem with a nonlinear state equation on a fixed reference domain. The Lagrange multiplier associated with the geometric shape constraint has a low regularity (similar to state constrained problems), which we circumvent by penalization and a ...

Quick Placement with Geometric Constraints

In this paper an original constraint-driven placement tool targeted for full-custom mixed-signal design is described. One of its main objectives is to quickly obtain feasible layout con gurations, and explore e ciently the e ect of di erent sets of constraints in an interactive environment. By using direct-approach algorithms, all feasible constraints are met by construction. Overconstraints ar...