Publication

Optimizing over the Growing Spectrahedron

Related publications (48)

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.

Approximating Parameterized Convex Optimization Problems.

Martin Jaggi

We extend Clarkson's framework by considering parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an ε-approximate solution (and a corresponding ε-coreset) ...

2010

On the computational complexity of periodic scheduling

Thomas Rothvoss

In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...

EPFL2009

Finite Rate of Innovation sampling techniques for embedded UWB devices.

Yann Barbotin

This report studies the applicability of Finite Rate of Innovation (FRI) algorithms to UltraWide Band (UWB) communications, more precisely in the scope of Low Power Body Area Networks (LP-BAN ). Three main issues are studied and given proposed solutions. F ...

2009

Monotone Comparative Statics: Geometric Approach

Thomas Alois Weber

We consider the comparative statics of solutions to parameterized optimization problems. A geometric method is developed for finding a vector field that, at each point in the parameter space, indicates a direction in which monotone comparative statics obta ...

Springer Verlag2008

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007

Efficient trapping of silver cations in a rare gas matrix: Ag3+ in argon

Sylvain Lecoultre, Alexandre Rydlo

Mass selected cations of Ag-clusters are deposited, together with Ar seeded with CO

_2

(or other electron scavengers such as O

_2

, N

_2

O, or CCl

_4

), on a cold substrate, while being flooded with low energy electrons. Optical absorption measurements re ...

2007

Structured Eigenvalue Problems

Daniel Kressner

Most eigenvalue problems arising in practice are known to be structured. Structure is often introduced by discretization and linearization techniques but may also be a consequence of properties induced by the original problem. Preserving this structure can ...

2006

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevie ...

2004

Block algorithms for orthogonal symplectic factorizations

Daniel Kressner

On the basis of a new WY-like representation block algorithms for orthogonal symplectic matrix factorizations are presented. Special emphasis is placed on symplectic QR and URV factorizations. The block variants mainly use level 3 (matrix-matrix) operation ...

2003

Effect of Spatio-Temporal Channel Correlation on the Performance of Space-Time Codes

Christina Fragouli

The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows ...

2002

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007

Efficient trapping of silver cations in a rare gas matrix: Ag3+ in argon

Sylvain Lecoultre, Alexandre Rydlo

Mass selected cations of Ag-clusters are deposited, together with Ar seeded with CO

_2

(or other electron scavengers such as O

_2

, N

_2

O, or CCl

_4

), on a cold substrate, while being flooded with low energy electrons. Optical absorption measurements re ...

2007