A Subspace Version of the Powell-Yuan Trust-Region Algorithm for Equality Constrained Optimization

Journal of the Operations Research Society of China

Volumn 1, Issue 4, 2013, Pages 425-451

  Grapiglia, Geovani Nunes ^a,b   Yuan, Jinyun ^a   Yuan, Ya xiang ^c  

^a FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

^b MINISTRY OF EDUCATION OF BRAZIL   (Brazil)

^c INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

Author keywords

Constrained optimization; Subspace methods; Trust region methods

Indexed keywords

ITERATIVE METHODS; VECTORS;

CONVERGENCE ANALYSIS; EQUALITY-CONSTRAINED OPTIMIZATION; OBJECTIVE FUNCTIONS; SUB-SPACE METHODS; SUITABLE CONDITIONS; TRUST REGION ALGORITHMS; TRUST REGION SUBPROBLEM; TRUST-REGION METHODS;

CONSTRAINED OPTIMIZATION;

EID: 84899108794     PISSN: 2194668X     EISSN: 21946698     Source Type: Journal    
DOI: 10.1007/s40305-013-0029-4     Document Type: Article

References (17)

1. Bjorck, A.: Numerical Methods for Least Square Problems. SIAM, Philadelphia (1996).
2. Celis, M. R., Dennis, J. E., Tapia, R. A.: A trust region strategy for nonlinear equality constrained optimization. In: Boggs, P. T., Byrd, R. H., Schnabel, R. B. (eds.) Numerical Optimization, pp. 71-82. SIAM, Philadelphia (1985).
3. Daniel, J. W., Gragg, W. B., Kaufman, L., Stewart, G. W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comput. 30, 772-795 (1976).
4. Dolan, E. D., Moré, J. J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201-213 (2002).
5. Gill, P. E., Leonard, M. W.: Reduced-Hessian quasi-Newton methods for unconstrained optimization. SIAM J. Optim. 12, 209-237 (2001).
6. Golub, G. H., van Loan, C. F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996).
7. Gong, L.: A trust region subspace method for large-scale unconstrained optimization. Asia-Pac. J. Oper. Res. 29, 1250021 (2012).
8. Gould, N. I. M., Orban, D., Toint, Ph. L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373-394 (2003).
9. Li, G., Yuan, Y.: Compute a Celis-Dennis-Tapia step. J. Comput. Math. 23, 463-478 (2005).
10. Powell, M. J. D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G. A. (ed.) Numerical Analysis, pp. 144-157. Springer, Berlin (1978).
11. Powell, M. J. D., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189-211 (1991).
12. Siegel, D.: Implementing and modifying Broyden class updates for large scale optimization. Report DAMPT 1992/NA12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, England (1992).
13. Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, Berlin (2006).
14. Wang, Z. H., Yuan, Y.: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numer. Math. 104, 241-269 (2006).
15. Yuan, Y.: On a subproblem of trust region algorithms for constrained optimization. Math. Program. 47, 53-63 (1990).
16. Yuan, Y.: A dual algorithm for minimizing a quadratic function with two quadratic constraints. J. Comput. Math. 9, 348-359 (1991).
17. Zhang, Y.: Computing a Celis-Dennis-Tapia trust region step for equality constrained optimization. Math. Program. 55, 109-124 (1992).