Error bound for a perturbed minimization problem related with the sum of smallest eigenvalues
AUTOR(ES)
Travaglia, Marcos Vinicio
FONTE
Computational & Applied Mathematics
DATA DE PUBLICAÇÃO
2010-06
RESUMO
Let C be a n×n symmetric matrix. For each integer 1 < k < n we consider the minimization problem m(ε): = minX{ Tr{CX} + εƒ(X)}. Here the variable X is an n×n symmetric matrix, whose eigenvalues satisfy the number ε is a positive (perturbation) parameter and ƒ is a Lipchitz-continuous function (in general nonlinear). It is well known that when ε = 0 the minimum value, m(0), is the sum of the smallest k eigenvalues of C. Assuming that the eigenvalues of C satisfy λ1(C) < ... < λk(C) < λk+1(C) < ∙∙∙ < λn(C), we establish the following upper and lower bounds for the minimum value m(ε): where is the minimum value of ƒ over the solution set of unperturbed problem and L is the Lipschitz-constant of ƒ. The above inequality shows that the error by replacing the upper bound (or the lower bound) by the exact value is at least quadratic in the perturbation parameter. We also treat the case that λk+1(C) = λk(C). We compare the exact solution with the upper and lower bounds for some examples. Mathematical subject classification: 15A42, 15A18, 90C22.
Documentos Relacionados
- Locating Eigenvalues of Perturbed Laplacian Matrices of Trees
- A heuristic for the minimization of open stacks problem
- Contact with friction using the augmented Lagrangian Method: a conditional constrained minimization problem
- The Probable Error of a Difference and the Selection Problem
- Capacited Vehicle Routing Problem with CO2 Emission Minimization Considering Path Slopes