Showing 1 - 10 of 20
We propose a class of preconditioners, which are also tailored for symmetric linear systems from linear algebra and nonconvex optimization. Our preconditioners are specifically suited for large linear systems and may be obtained as by-product of Krylov subspace solvers. Each preconditioner in...
Persistent link: https://www.econbiz.de/10014041094
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the companion paper The latter was constructed by using information from a Krylov subspace method, adopted to solve the large symmetric linear system Ax = b. We first estimate the condition number of...
Persistent link: https://www.econbiz.de/10014041095
In this paper the use of Artificial Neural Networks (ANNs) in on-line booking for hotel industry is investigated. The paper details the description, the modeling and the resolution technique of on-line booking. The latter problem is modeled using the paradigms of machine learning, in place of...
Persistent link: https://www.econbiz.de/10014041104
In this paper we analyze some issues related to the general problem of information spreading among individuals, where suitable assumptions on the information exchange are considered. In particular, starting from the scheme proposed in [5], which is based on a majority rule to treat the...
Persistent link: https://www.econbiz.de/10014041107
We consider the solution of a recurrent sub–problem within both constrained and unconstrained Nonlinear Programming: namely the minimization of a quadratic function subject to linear constraints. This problem appears in a number of LBM frameworks, and to some extent it reveals a close analogy...
Persistent link: https://www.econbiz.de/10014081233
In the classical model for portfolio selection the risk is measured by the variance of returns. It is well known that, if returns are not elliptically distributed, this may cause inaccurate investment decisions. To address this issue, several alternative measures of risk have been proposed. In...
Persistent link: https://www.econbiz.de/10013114329
We consider the solution of bound constrained optimization problems, where we assume that the evaluation of the objective function is costly, its derivatives are unavailable and the use of exact derivative-free algorithms may imply a too large computational burden. There is plenty of real...
Persistent link: https://www.econbiz.de/10013076275
Persistent link: https://www.econbiz.de/10009717290
Persistent link: https://www.econbiz.de/10003871484
Persistent link: https://www.econbiz.de/10011628275