Abstract
We study a subproblem that arises in some trust region algorithms for equality constrained optimization. It is the minimization of a general quadratic function with two special quadratic constraints. Properties of such subproblems are given. It is proved that the Hessian of the Lagrangian has at most one negative eigenvalue, and an example is presented to show that the Hessian may have a negative eigenvalue when one constraint is inactive at the solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.R. Celis, J.E. Dennis and R.A. Tapia, “A trust region strategy for nonlinear equality constrained optimization,” in: P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds.,Numerical Optimization (SIAM, Philadelphia, PA 1985) pp. 71–82.
R. Fletcher,Practical Methods for Optimization, Vol. 2: Constrained Optimization (Wiley, Chichester, 1981).
D.M. Gay, “Computing optimal locally constrained steps,”SIAM Journal on Scientific and Statistical Computing 2 (1981) 186–197.
J.J. Moré and D.C. Sorensen, “Computing a trust region step,”SIAM Journal on Scientific and Statistical Computing 4 (1983) 553–572.
M.J.D. Powell and Y. Yuan, “A trust region algorithm for equality constrained optimization,” Report DAMTP 1986/NA2, University of Cambridge (Cambridge, UK).
Author information
Authors and Affiliations
Additional information
Research supported by a Research Fellowship of Fitzwilliam College, Cambridge, and by a research grant from the Chinese Academy of Sciences.
Rights and permissions
About this article
Cite this article
Yuan, Y. On a subproblem of trust region algorithms for constrained optimization. Mathematical Programming 47, 53–63 (1990). https://doi.org/10.1007/BF01580852
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580852