Approximate dynamic programming via sum of squares programming
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.
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in Kaibel and Pfetsch [Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming ...
Multi-object tracking can be achieved by detecting objects in individ- ual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in pre ...
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise affine function that ...
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by ...
Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...
In a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations, the construction of lower bounds for the coercivity and inf-sup stability constants is essential. In [Huynh et al., C. R. Acad. Sci. Par ...
In this paper, we introduce the notion of a constrained Minkowski sum: for two (finite) point-sets P, Q subset of R-2 and a set of k inequalities Ax >= b, it is defined as the point-set (P circle plus Q)(Ax >= b) = {x = p + q vertical bar p is an element o ...
An optimal planning method is proposed for the renewal planning problem of an energy supply system installed into building from economic viewpoint. In this method, the objective function to be minimized is the average annual total cost during the evaluatio ...
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 ...
Spectrum sensing is an essential functionality that enables cognitive radios to detect spectral holes and to opportunistically use under-utilized frequency bands without causing harmful interference to legacy (primary) networks. In this paper, a novel wide ...
Institute of Electrical and Electronics Engineers2009
