Abstract
In this paper the numerical stability of the orthogonal factorization method [5] for linear equality-constrained quadratic programming problems is studied using a backward error analysis. A perturbation formula for the problem is analyzed; the condition numbers of this formula are examined in order to compare them with the condition numbers of the two matrices of the problem. A class of test problems is also considered in order to show experimentally the behaviour of the method.
Zusammenfassung
Mit Hilfe einer Rückwärtsanalyse untersuchen wir die numerische Stabilität der orthogonalen Faktorisierung nach [5] für quadratische Optimierungsprobleme mit linearen Gleichungsbedingungen. Dabei wird eine Störungsformel für das Problem analysiert, deren Konditionszahlen mit den Konditionszahlen der zwei Matrizen des Problems verglichen werden. Experimentell wird das Verhalten des Verfahrens mit Hilfe einer Klasse von Testproblemen untersucht.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arioli, M.: Perturbation theory for the quadratic programming problem with linear equality constraints. CNR, Istituto di Elaborazione della Informazione B84-20, Pisa (1984).
Betts, J. T.: A compact algorithm for computing the stationary point of a quadratic function subject to linear constraints. ACM Trans. Math. Software6, 391–397 (1980).
Dongarra, J. J., Bunch, J. R., Moler, C. B., Stewart, G. W.: Linpack Users’ Guide. Philadelphia: SIAM 1979.
Eldén, L.: Perturbation theory for the least squares problem with linear equality constraints. SIAM J. Numer. Anal.17, 338–350 (1980).
Fletcher, R.: Practical methods of optimization. Chichester: Wiley 1987.
Galligani, E., Laratta, A.: Error analysis of null space method for linear equality constrained least squares problems. Computing52, 161–176 (1994).
Galligani, E., Zanni, L.: On the efficiency and numerical stability of orthogonal factorization method for equality-constrained quadratic programming problems. CNR, Tech. Report on Project “Sistemi Informatici e Calcolo Parallelo” 1/191, Rome (1994).
Kielbasiński, A.: A note on rounding-error analysis of Cholesky factorization. Linear Algebra Appl.88/89, 487–494 (1987).
Laratta, A., Zironi, F.: Numerical solution of linear least squares problems with linear equality constraints. J. Optim. Theory Appl.65, 67–83 (1990).
Lawson, C. L., Hanson, R. J.: Solving least squares problems. Englewood Cliffs: Prentice-Hall 1974.
Luenberger, D. G.: Linear and nonlinear programming. Reading: Addison-Wesley, 1984.
Magnus, J. R., Neudecker, H.: Matrix differential calculus with applications in statistics and econometrics. Chichester: Wiley 1988.
Ruggiero, V., Zama, F.: Randomly generated equality-constrained quadratic programing test problems. CNR, Tech. Report on Project “Sistemi Informatici e Calcolo Parallelo” 1/82, Rome (1991).
Steward, G. W.: The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM J. Numer. Anal.17, 403–409 (1980).
Wilkinson, J. H.: The algebraic eigenvalue problem. London: Oxford University Press 1965.
Author information
Authors and Affiliations
Additional information
Work supported by M.U.R.S.T. 40% projectAnalisi Numerica e Matematica Computazionale.
Rights and permissions
About this article
Cite this article
Galligani, E., Zanni, L. Error analysis of an algorithm for equality-constrained quadratic programming problems. Computing 58, 47–67 (1997). https://doi.org/10.1007/BF02684471
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684471