Concept

Covering problems

Publications associées (46)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Enumeration-based approach to solving parametric linear complementarity problems

Colin Neil Jones

This paper presents a solution method for parametric linear complementarity problems (PLCP) that relies on an enumeration technique to discover all feasible bases. The enumeration procedure is based on evaluating all possible combinations of active constra ...

Elsevier2015

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

Daniel Kuhn, Wolfram Wiesemann

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can ...

Springer Verlag2015

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

An inexact proximal path-following algorithm for constrained convex minimization

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis

Many scientific and engineering applications feature large-scale non-smooth convex minimization problems over convex sets. In this paper, we address an important instance of this broad class where we assume that the non-smooth objective is equipped with a ...

Siam Publications2014

Convergence of a stabilized discontinuous Galerkin method for incompressible nonlinear elasticity

Alfio Quarteroni, Ricardo Esteban Ruiz Baier, Davide Baroli

In this paper we present a discontinuous Galerkin method applied to incompressible nonlinear elastostatics in a total Lagrangian deformation-pressure formulation, for which a suitable interior penalty stabilization is applied. We prove that the proposed di ...

Springer Verlag2013

Geometric Variational Models for Inverse Problems in Imaging

Virginia Estellers Casas

This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...

EPFL2013

Completeness and Ambiguity of Schema Cover

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós

Given a schema and a set of concepts, representative of entities in the domain of discourse, schema cover deﬁnes correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly si ...

2013

Anisotropic Interpolation of Sparse Generalized Image Samples

Michaël Unser, Aurélien Bourquard

Practical image-acquisition systems are often modeled as a continuous-domain prefilter followed by an ideal sampler, where generalized samples are obtained after convolution with the impulse response of the device. In this paper, our goal is to interpolate ...

Ieee-Inst Electrical Electronics Engineers Inc2013

On stable self-similar blow up for equivariant wave maps: The linearized problem

Roland Donninger

We consider co-rotational wave maps from (3+1) Minkowski space into the three-sphere. This is an energy supercritical model which is known to exhibit finite time blow up via self-similar solutions. The ground state self-similar solution

f_0

is known in c ...

2012

Approximability of Sparse Integer Programs

David Pritchard

The main focus of this paper is a pair of new approximation algorithms for certain integer programs. First, for covering integer programs {min cx:Ax≥b,0≤x≤d} where A has at most k nonzeroes per row, we give a k-approximation algorithm. (We assume A,b,c,d a ...

Springer-Verlag2011

On stable self-similar blow up for equivariant wave maps: The linearized problem

Roland Donninger

f_0

is known in c ...

2012