Concept

Semidefinite programming

Related publications (214)

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

We study a natural generalization of the problem of minimizing makespan on unrelated machines in which jobs may be split into parts. The different parts of a job can be (simultaneously) processed on different machines, but each part requires a setup time b ...

Springer2014

Selling robustness margins: A framework for optimizing reserve capacities for linear systems

Maryam Kamgarpour, Xiuwei Zhang

This paper proposes a method for solving robust optimal control problems with modulated uncertainty sets. We consider constrained uncertain linear systems and interpret the uncertainty sets as “robustness margins” or “reserve capacities”. In particular, gi ...

IEEE2014

Estimating the ice thickness of shallow glaciers from surface topography and mass-balance data with a shape optimization algorithm

Marco Picasso, Laurent Michel, Heinz Blatter, Martin Funk

A shape optimization algorithm is presented that estimates the ice thickness distribution within a three-dimensional, shallow glacier, given a transient surface geometry and a mass-balance distribution. The approach is based on the minimization of the surf ...

Pergamon-Elsevier Science Ltd2014

LP-Based Algorithms for Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

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 ...

IEEE2014

Convex computation of the region of attraction of polynomial control systems

Milan Korda

We address the long-standing problem of computing the region of attraction (ROA) of a target set (typically a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We ...

Institute of Electrical and Electronics Engineers2014

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Dictionary learning over large distributed models via dual-ADMM strategies

Ali H. Sayed

We consider the problem of dictionary learning over large scale models, where the model parameters are distributed over a multi-agent network. We demonstrate that the dual optimization problem for inference is better conditioned than the primal problem and ...

IEEE2014

Sparsity in tensor optimization for optical-interferometric imaging

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Anna Auria Rasclosa

Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bispectrum measurements. We review our previous work, which reformulates this nonlinear problem in the framework of tensor recover ...

IEEE2014

Approximation schemes for many-objective query optimization

Christoph Koch, Immanuel Trummer

The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive MO ...

ACM Press2014

Toward a Verifiable Software Dataplane

Mihai Dobrescu

Software dataplanes are emerging as an alternative to traditional hardware switches and routers, promising programmability and short time to market. These advantages are set against the concern of introducing buggy or under-performing code into the network ...

2013

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.