A uniqueness result concerning a robust regularized least-squares solution
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.
Interplay between Identification and Optimization in Run-to-run Schemes B. Srinivasan, D. Bonvin ´ Institut d’Automatique, Ecole Polytechnique F´d´rale de Lausanne, ee CH-1015 Lausanne, Switzerland. Optimization of batch processes has received increasing at ...
This paper formulates and solves a robust criterion for least-squares designs in the presence of uncertain data. Compared with earlier studies, the proposed criterion incorporates simultaneously both regularization and weighting and applies to a large clas ...
Society for Industrial and Applied Mathematics2002
This paper addresses the issue of robust filtering for time varying uncertain discrete time systems. The proposed robust filters are based on a regularized least-squares formulation and guarantee minimum state error variances. Simulation results indicate t ...
In most applications related to transportation, it is of major importance to be able to identify the global optimum of the associated optimization problem. The work we present in this paper is motivated by the optimization problems arising in the maximum l ...
We propose a new optimizer in the context of multimodal image registration. The optimized criterion is the mutual in formation between the images to align. This criterion requires that their joint histogram be available. For its computation, we introduce d ...
We propose a new heuristic for nonlinear global optimization combining a variable neighborhood search framework with a modified trust-region algorithm as local search. The proposed method presents the capability to prematurely interrupt the local search if ...
