Scalable Convex Optimization Methods for Semidefinite Programming
Publications associées (174)
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.
This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem definition for power efficient data gathering and assess its computational difficult ...
We have developed a new derivative-free algorithm based on Radial Basis Functions (RBFs). Derivative-free optimization is an active field of research and several algorithms have been proposed recently. Problems of this nature in the industrial setting are ...
We present a method that exploits an information theoretic framework to extract optimized audio features using the video information. A simple measure of mutual information (MI) between the resulting audio features and the video ones allows to detect the a ...
We define the distributed, real-time combinatorial optimization problem. We propose a general, semantically well-defined notion of solution stability in such systems, based on the cost of change from an already implemented solution to the new one. This app ...
This paper presents a decomposition approach for a quite general class of mixed- integer dynamic optimization problems that is capable of guaranteeing the global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case s ...
Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their potentia ...
This paper presents a decomposition approach for a quite general class of mixed-integer dynamic optimization problems that is capable of guaranteeing a global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case stud ...
We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...
This paper presents an efficient simplification method for regular meshes obtained with a binary subdivision scheme. Our mesh connectivity is constrained with a quadtree data structure. We propose a quadtree built especially for this class of meshes having ...
Pb(Mg1/3Nb2/3)O-3 (PMN) alkoxide precursor solutions were synthesized and used to prepare thin layers on TiO2/Pt/TiO2/SiO2/Si substrates by spin coating. Many parameters like homogeneity of the solution and appropriate processing must be controlled to mini ...