Dealing with singularities in nonlinear unconstrained optimization
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.
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 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 ...
Discrete optimization is a difficult task common to many different areas in modern research. This type of optimization refers to problems where solution elements can assume one of several discrete values. The most basic form of discrete optimization is bin ...
Econometric models play an important role in transportation analysis. Estimating more and more complex models becomes problematic. The associated log-likelihood function is highly nonlinear and non concave and the comlexity of the model requires constraint ...
Econometric models play an important role in transportation analysis. Estimating more and more complex models becomes problematic. The associated log-likelihood function is highly nonlinear and non concave and the comlexity of the model requires constraint ...
