Showing 1 - 7 of 7
This paper proposes finite mixtures of different Archimedean copula families as a flexible tool for modelling the dependence structure in multivariate data. A novel approach to estimating the parameters in this mixture model is presented by maximizing the penalized marginal likelihood via...
Persistent link: https://www.econbiz.de/10010998442
The aim of this paper is to propose an algorithm, based on the optimal level solutions method, which solves a particular class of box constrained quadratic problems. The objective function is given by the sum of a quadratic strictly convex separable function and the square of an affine function...
Persistent link: https://www.econbiz.de/10010847474
Local optimality conditions are given for a quadratic programming formulation of the multiset graph partitioning problem. These conditions are related to the structure of the graph and properties of the weights. Copyright Springer-Verlag Berlin Heidelberg 2002
Persistent link: https://www.econbiz.de/10010847601
Effective risk management requires adequate risk measurement. A basic problem herein is the quantification of market risks: what is the overall effect on a portfolio if market rates change? First, a mathematical problem statement is given and the concept of `Maximum Loss' (ML) is introduced as a...
Persistent link: https://www.econbiz.de/10010847869
Convex quadratic programming (QP) is of reviving interest in the last few years, since in connection with interior point methods Sequential Quadratic Programming (SQP) has been assessed as a powerful algorithmic scheme for solving nonlinear constraint optimization problems.  In this paper we...
Persistent link: https://www.econbiz.de/10010848015
In this paper we propose a new nonparametric regression method called composite support vector quantile regression (CSVQR) that combines the formulations of support vector regression and composite quantile regression. First the CSVQR using the quadratic programming (QP) is proposed and then the...
Persistent link: https://www.econbiz.de/10011151858
We consider an inverse quadratic programming (QP) problem in which the parameters in both the objective function and the constraint set of a given QP problem need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a linear...
Persistent link: https://www.econbiz.de/10010759221