Non-smooth Non-convex Bregman Minimization: Unification and new Algorithms

We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate minimizer of the model function yields a descent direction, along which the next iterate is found. Complemented with an Armijo-like line search strategy, we obtain a flexible algorithm for which we prove (subsequential) convergence to a stationary point under weak assumptions on the growth of the model function error. Special instances of the algorithm with a Euclidean distance function are, for example, Gradient Descent, Forward--Backward Splitting, ProxDescent, without the common requirement of a "Lipschitz continuous gradient". In addition, we consider a broad class of Bregman distance functions (generated by Legendre functions) replacing the Euclidean distance. The algorithm has a wide range of applications including many linear and non-linear inverse problems in signal/image processing and machine learning

Did F. A. Hayek Embrace Popperian Falsificationism? A Critical Comment About Certain Theses of Popper, Duhem and Austrian Methodology

Hayek´s methodological outlook at the time he engaged in business cycle research was actually closer to praxeological apriorism than to Popperian falsificationism. A consideration of the Duhem thesis highlights the fact that even from a mainstream methodological perspective falsificationism is more problematic than is often realized. Even if the praxeological and mainstream lines of argumentation reject the Popperian emphasis on falsification for different reasons and from a different background, the prospects for falsificationism in economic methodology seem rather bleak.General methodology; falsificationism; Popper; Hayek; Duhem; Duhemian Argument; Testing of Theories; Meaning and Interpretation of Econometric Results; Correlation and Causality;

Fuzzy expert systems in civil engineering

Imperial Users onl

PREDICTIVE MATURITY OF INEXACT AND UNCERTAIN STRONGLY COUPLED NUMERICAL MODELS

The Computer simulations are commonly used to predict the response of complex systems in many branches of engineering and science. These computer simulations involve the theoretical foundation, numerical modeling and supporting experimental data, all of which contain their associated errors. Furthermore, real-world problems are generally complex in nature, in which each phenomenon is described by the respective constituent models representing different physics and/or scales. The interactions between such constituents are typically complex in nature, such that the outputs of a particular constituent may be the inputs for one or more constituents. Thus, the natural question then arises concerning the validity of these complex computer model predictions, especially in cases where these models are executed in support of high-consequence decision making. The overall accuracy and precision of the coupled system is then determined by the accuracy and precision of both the constituents and the coupling interface. Each constituent model has its own uncertainty and bias error. Furthermore, the coupling interface also brings in a similar spectrum of uncertainties and bias errors due to unavoidably inexact and incomplete data transfer between the constituents. This dissertation contributes to the established knowledge of partitioned analysis by investigating the numerical uncertainties, validation and uncertainty quantification of strongly coupled inexact and uncertain models. The importance of this study lies in the urgent need for gaining a better understanding of the simulations of coupled systems, such as those in multi-scale and multi-physics applications, and to identify the limitations due to uncertainty and bias errors in these models