Scenario-free stochastic programming with polynomial decision rules
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.
Certain optimization problems in communication systems, such as limited-feedback constant-envelope beamforming or noncoherent M-ary phase-shift keying (MPSK) sequence detection, result in the maximization of a fixed-rank positive semidefinite quadratic for ...
Institute of Electrical and Electronics Engineers2014
Assume that a stochastic process can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxima ...
Continuous linear programs have attracted considerable interest due to their potential for modeling manufacturing, scheduling, and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude ...
We consider networks of agents cooperating to minimize a global objective, modeled as the aggregate sum of regularized costs that are not required to be differentiable. Since the subgradients of the individual costs cannot generally be assumed to be unifor ...
This thesis consists of two parts. The first part is about a variant of Banach's fixed point theorem and its applications to several partial differential equations (PDE's), abstractly of the form [ \mathcal Lu + \mathcal Q(u) = f.] The main result of thi ...
We investigate the general iterative controller tuning (ICT) problem, where the task is to find a set of controller parameters that optimize some user-defined performance metric when the same control task is to be carried out repeatedly. Following a repeat ...
Optimization is important in science and engineering as a way of finding ”optimal” situations, designs or operating conditions. Optimization is typically performed on the basis of a mathematical model of the process under investigation. In practice, optimi ...
We prove a fixed point theorem for a family of Banach spaces, notably for L^1. Applications include the optimal answer to the "derivation problem" for group algebras which originated in the 1960s. ...
We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...
We consider solving multi-objective optimization problems in a distributed manner by a network of cooperating and learning agents. The problem is equivalent to optimizing a global cost that is the sum of individual components. The optimizers of the individ ...