Calibrating Least Squares Covariance Matrix Problems with Equality and Inequality Constraints
نویسندگان
چکیده
In many applications in finance, insurance, and reinsurance, one seeks a solution of finding a covariance matrix satisfying a large number of given linear equality and inequality constraints in a way that it deviates the least from a given symmetric matrix. One difficulty in finding an efficient method for solving this problem is due to the presence of the inequality constraints. In this paper, we propose to overcome this difficulty by reformulating the problem as a system of semismooth equations with two level metric projection operators. We then design an inexact smoothing Newton method to solve the resulted semismooth system. At each iteration, we use the BiCGStab iterative solver to obtain an approximate solution to the generated smoothing Newton linear system. Our numerical experiments confirm the high efficiency of the proposed method.
منابع مشابه
Least-Squares Covariance Matrix Adjustment
We consider the problem of finding the smallest adjustment to a given symmetric n × n matrix, as measured by the Euclidean or Frobenius norm, so that it satisfies some given linear equalities and inequalities, and in addition is positive semidefinite. This least-squares covariance adjustment problem is a convex optimization problem, and can be efficiently solved using standard methods when the ...
متن کاملCalibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
In this paper, we consider the least squares semidefinite programming with a large number of equality and inequality constraints. One difficulty in finding an efficient method for solving this problem is due to the presence of the inequality constraints. In this paper, we propose to overcome this difficulty by reformulating the problem as a system of semismooth equations with two level metric p...
متن کاملA partial proximal point algorithm for nuclear norm regularized matrix least squares problems
We introduce a partial proximal point algorithm for solving nuclear norm regularized matrix least squares problems with equality and inequality constraints. The inner subproblems, reformulated as a system of semismooth equations, are solved by an inexact smoothing Newton method, which is proved to be quadratically convergent under a constraint non-degeneracy condition, together with the strong ...
متن کاملOn the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
When solving the general smooth nonlinear optimization problem involving equality and/or inequality constraints, an approximate first-order critical point of accuracy ǫ can be obtained by a second-order method using cubic regularization in at most O(ǫ) problem-functions evaluations, the same order bound as in the unconstrained case. This result is obtained by first showing that the same result ...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کامل