Stochastic Three-Composite Convex Minimization with a Linear Operator
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Any finite, separately convex, positively homogeneous function on R2 is convex. This was first established by the first author ["Direct methods in calculus of variations", Springer-Verlag (1989)]. Here we give a new and concise proof of this re ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
We analyze some queueing problems arising in guaranteed service and controlled load networks using min-plus algebra. We find an explicit representation for the sub-additive closure of the minimum of two operators, and we introduce a new, useful family of i ...
When producing a mosaic of multiple multi-spectral images one needs to harmonize the colours so that the tone transition is smooth from one image to the other. Given two images Im(a) and Im(b), a transform T is sought to map Im(b) to an image that is harmo ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
We analyze some queueing problems arising in guaranteed service and controlled load networks using min-plus algebra. We find an explicit representation for the sub-additive closure of the minimum of two operators, and we introduce a new, useful family of i ...
When producing a mosaic of multiple multi-spectral images one needs to harmonize the colours so that the tone transition is smooth from one image to the other. Given two images Ima and Imb , a transform T is sought to map Imb ...
Convex parameterization of fixed-order robust stabilizing controllers for systems with polytopic uncertainty is represented as an LMI using KYP Lemma. This parameterization is a convex inner-approximation of the whole non- convex set of stabilizing control ...
We formulate the tomographic reconstruction problem in a variational setting. The object to be reconstructed is considered as a continuous density function, unlike in the pixel-based approaches. The measurements are modeled as linear operators (Radon trans ...
