Abstract
In this paper, we present a subspace method for solving large scale nonlinear equality constrained optimization problems. The proposed method is based on a SQP method combined with the limited-memory BFGS update formula. Each subproblem is solved in a theoretically suitable subspace. In the case of few constraints, we show that our search direction in the subspace is equivalent to that of the SQP subproblem in the full space. In the case of many constraints, we reduce the number of constraints in the subproblem and we show that the solution of the subspace subproblem is a descent direction of a particular exact penalty function. Global convergence properties of the proposed method are given for both cases. Numerical results are given to illustrate the soundness of the proposed model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63, 129–156 (1994)
Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numer. 4, 1–51 (1995)
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 1984, pp. 71–82. SIAM, Philadelphia (1985)
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)
Gill, P.E., Leonard, M.W.: Reduced-Hessian quasi-Newton methods for unconstrained optimization. SIAM J. Optim. 6, 418–445 (1996)
Gould, N.I.M., Toint, P.L.: SQP methods for large-scale nonlinear programming. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory and Applications. Kluwer, Dordrecht (2000)
Gould, N.I.M., Orban, D., Toint, PhL: Numerical methods for large-scale nonlinear optimization. Acta Numer. 14, 299–361 (2005)
Gould, N.I.M., Orban, D., Toint, PhL: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545–557 (2015)
Grapiglia, G.N., Yuan, J., Yuan, Y.: A subspace version of the Powell–Yuan trust region algorithm for equality constrained optimization. J. Oper. Res. Soc. China 1(4), 425–451 (2013)
Han, S.-P., Mangasarian, O.L.: Exact penalty functions in nonlinear programming. Math. Program. 17, 251–269 (1979)
Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773–782 (1980)
Nocedal, J., Wright, S.J.: Numerical Optimization (Springer Series in Operations Research), 2nd edn. Springer, New York (2006)
Powell, M.J.D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A. (ed.) Numerical Analysis Dundee 1977 (Lecture Notes in Mathematics 630), pp. 144–157. Springer, Berlin (1978)
Powell, M.J.D.: Variable metric methods for constrained optimization. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Mathematical Programming: The State of the Art, Bonn, 1982, pp. 288–311. Springer, Berlin (1983)
Stoer, J., Yuan, Y.: A subspace study on conjugate gradient algorithms. ZAMM Z. Angew. Math. Mech. 75, 69–77 (1995)
Vlček, J., Lukšan, L.: New variable metric methods for unconstrained minimization covering the large-scale case. Technical report No. V876, Institute of Computer Science, Academy of Sciences of the Czech Republic (2002)
Wang, Z.-H., Wen, Z.-W., Yuan, Y.: A subspace trust region method for large scale unconstrained optimization. In: Yuan, Y. (ed.) Numerical Linear Algebra and Optimization, pp. 265–274. Science Press, Beijing (2004)
Wang, Z.-H., Yuan, Y.: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numer. Math. 104, 241–269 (2006)
Yuan, Y.: Subspace techniques for nonlinear optimization. In: Jeltsch, R., Li, T., Sloan, I.H. (eds.) Some Topics in Industrial and Applied Mathematics (Series in Contemporary Applied Mathematics CAM 8), pp. 206–218. Higher Education Press, Beijing (2007)
Yuan, Y.: Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim. Eng. 10, 207–218 (2009)
Yuan, Y.: A review on subspace methods for nonlinear optimization. In: Proceedings of International Congress of Mathematicians 2014 Seoul, Korea, pp. 807–827 (2014)
Zhao, X., Fan, J.: Subspace choices for the Celis–Dennis–Tapia problem. Sci. China Math. 60, 1717–1732 (2017)
Zhao, X., Fan, J.: On subspace properties of the quadratically constrained quadratic program. J. Ind. Manag. Optim. 13, 1625–1640 (2017)
Acknowledgements
The authors would like to thank Professor Jinyan Fan and anonymous referees for their kind advice and modifications. This work was supported by the National Research Foundation of Korea (NRF) NRF-2016R1A5A1008055. The second author was supported by the National Research Foundation of Korea (NRF) NRF-2016R1D1A1B03931337. The fourth author was supported by the National Research Foundation of Korea (NRF) NRF-2016R1D1A1B03934371.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lee, J.H., Jung, Y.M., Yuan, Yx. et al. A subspace SQP method for equality constrained optimization. Comput Optim Appl 74, 177–194 (2019). https://doi.org/10.1007/s10589-019-00109-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-019-00109-6
Keywords
- Equality constrained optimization
- SQP method
- Large scale problems
- Subspace techniques
- Damped limited-memory BFGS update