Publication

A Scalable Method for Multiagent Constraint Optimization

Publications associées (90)

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

Strengths and Limitations of Linear Programming Relaxations

Abbas Bazzi

Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power, this class of algorithms seems to contain the most favourable ...

EPFL2017

, ,

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have, however, large requirements in terms of both network and computational resources ...

2017

Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage

Volkan Cevher, Alp Yurtsever

This paper considers a fundamental class of convex matrix optimization problems with low-rank solutions. We show it is possible to solve these problem using far less memory than the natural size of the decision variable when the problem data has a concise ...

2017

DUCT: An Upper Confidence Bound Approach to Distributed Constraint Optimization Problems

Boi Faltings, Christos Dimitrakakis, Brammert Ottens

We propose a distributed upper confidence bound approach, DUCT, for solving distributed constraint optimization problems. We compare four variants of this approach with a baseline random sampling algorithm, as well as other complete and incomplete algorith ...

Assoc Computing Machinery2017

The D-Wave adiabatic quantum annealer solves hard combinatorial optimization problems leveraging quantum physics. The newest version features over 1000 qubits and was released in August 2015. We were given access to such a machine, currently hosted at NASA ...

Assoc Computing Machinery2016

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

Michael Maximilian Steinlechner

In this thesis, we present a Riemannian framework for the solution of high-dimensional optimization problems with an underlying low-rank tensor structure. Here, the high-dimensionality refers to the size of the search space, while the cost function is scal ...

EPFL2016

Multisymplectic Variational Integrators For Nonsmooth Lagrangian Continuum Mechanics

Tudor Ratiu, François Gay-Balmaz, François Marie Alain Demoures

This paper develops the theory of multisymplectic variational integrators for nonsmooth continuum mechanics with constraints. Typical problems are the impact of an elastic body on a rigid plate or the collision of two elastic bodies. The integrators are ob ...

Cambridge Univ Press2016

Demand-based discrete optimization

Michel Bierlaire, Shadi Sharif Azadeh

We propose a methodological framework to include a wide variety of discrete choice models in (mixed) integer optimization problems. We succeed in obtaining a specification that is linear in the decision variables, allowing to use exact methods to solve the ...

2016

MPC for Tracking Periodic References

Colin Neil Jones, Melanie Nicole Zeilinger

In this technical note, a new model predictive controller for tracking arbitrary periodic references is presented. The proposed controller is based on a single layer that unites dynamic trajectory planning and control. A design procedure to guarantee that ...

Institute of Electrical and Electronics Engineers2016

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Nikolaos Geroliminis, Jack Haddad, Mohammadreza Hajiahmadi

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...

Institute of Electrical and Electronics Engineers2015