A heuristic for nonlinear global optimization relevant to discrete choice models estimation
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.
Approximate computing has gained high attention in various applications that can benefit from a reduction in costs by lowering the accuracy. In this paper we present an optimization approach for functional approximation of Binary Decision Diagrams (BDDs) w ...
We study a phase retrieval problem in the Poisson noise model. Motivated by the PhaseLift approach, we approximate the maximum-likelihood estimator by solving a convex program with a nuclear norm constraint. While the Frank-Wolfe algorithm, together with t ...
Solving a multi-input dynamic optimization of a batch processes is a complex problem involving interactions between input variables and constraints over time. The problem gets more difficult due to the presence of local solutions that have almost the same ...
In this paper, we propose a model order reduction framework for parametrized quadratic optimization problems constrained by nonlinear stationary PDEs. Once the solutions of the optimization problem are characterized as the solutions of the corresponding op ...
Different than the conventional queueing systems, in spatial queueing systems (SQS) the service rate for each customer-server pairs differs and the server that intervenes for a specific customer is not known a priori, depending on the availability of serve ...
We consider networks of agents cooperating to minimize a global objective, modeled as the aggregate sum of regularized costs that are not required to be differentiable. Since the subgradients of the individual costs cannot generally be assumed to be unifor ...
This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow par ...
The size and shape of particles crucially influences the characteristics of solid products. Until recently these quantities were evaluated using light microscopy. However, extracting the three-dimensional shape of a faceted crystal from a single image is a ...
The management of uncertainties is a challenging task for reliable and secure operation of power systems. The uncertainties come from multiple sources, including the forecast errors of wind power and load, the forced outage of generating units, loss of tra ...
We propose a vector space approach for inverse rendering of a Lambertian convex object with distant light sources. In this problem, the texture of the object and arbitrary lightings are both to be recovered from multiple images of the object and its 3D mod ...
