The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP
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 present a new approach for the construction of lower bounds for the inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. We combine the ``linearized' ...
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...
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 ...
Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodo ...
Multiview video refers to videos of the same dynamic 3-D scene captured simultaneously by multiple closely spaced cameras from different viewpoints. We study interactive streaming of pre-encoded multiview videos, where, at any time, a client can request an ...
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 ...
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addressing time and thereby also the amplitude of the electrical current through ...
An optimization method based on Mixed Integer Linear Programming (MILP) has been developed for simultaneous optimization of water and energy (SOWE) in industrial processes. The superstructure integrates process thermal streams and optimizes the consumption ...
The usual approach to dealing with Mixed Logical Semidefinite Programs (MLSDPs) is through the “Big-M” or the convex hull reformulation. The Big-M approach is appealing for its ease of modeling, but it leads to weak convex relaxations when used in a Branch ...
While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the large size of the r ...
