Skip to main content
Erschienen in: Journal of Applied Mathematics and Computing 1-2/2016

01.02.2016 | Original Research

On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization

verfasst von: Xiaojing Zhu

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1-2/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Recently, a novel step acceptance mechanism for equality constrained optimization was proposed by Zhu and Pu (Comput. Appl. Math. 31(2):407–432, 2012). This new mechanism uses an infeasibility control technique that is quite different from traditional penalty functions and filters. However, in that paper, global convergence of the algorithm with this new mechanism was proved in a double trust regions framework where a strong assumption on step sizes must be required. In this paper, we improve Zhu and Pu’s work and furnish a complete global convergence proof for this infeasibility control mechanism in a standard trust region framework where some mild assumptions are sufficient. In addition, numerical results on a number of CUTEr problems accompanied by comparison with SNOPT show the efficiency of the proposed algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Byrd, R.H., Schnabel, R.B., Shultz, G.A.: A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal. 24, 1152–1170 (1987)MathSciNetCrossRefMATH Byrd, R.H., Schnabel, R.B., Shultz, G.A.: A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal. 24, 1152–1170 (1987)MathSciNetCrossRefMATH
2.
Zurück zum Zitat Celis, M.R., Dennis Jr, 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) Celis, M.R., Dennis Jr, 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.
Zurück zum Zitat Conn, A.R., Gould, N.I.M., Toint, PhL: Trust-Region Methods, MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)CrossRef Conn, A.R., Gould, N.I.M., Toint, PhL: Trust-Region Methods, MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)CrossRef
4.
Zurück zum Zitat Lalee, M., Nocedal, J., Plantenga, T.: On the implementation of an algorithm for large-scale equalty constrained optimization. SIAM J. Optim. 8, 682–706 (1998)MathSciNetCrossRefMATH Lalee, M., Nocedal, J., Plantenga, T.: On the implementation of an algorithm for large-scale equalty constrained optimization. SIAM J. Optim. 8, 682–706 (1998)MathSciNetCrossRefMATH
5.
Zurück zum Zitat Omojokun, E.O.: Trust region algorithms for optimization with nonlinear equality and inequality constraints, Ph.D. thesis, Dept. of Computer Science, University of Colorado, Boulder (1989) Omojokun, E.O.: Trust region algorithms for optimization with nonlinear equality and inequality constraints, Ph.D. thesis, Dept. of Computer Science, University of Colorado, Boulder (1989)
6.
Zurück zum Zitat Powell, M.J.D., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189–211 (1991)MathSciNetCrossRef Powell, M.J.D., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189–211 (1991)MathSciNetCrossRef
8.
Zurück zum Zitat Fletcher, R., Leyffer, S., Toint, PhL: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13, 44–59 (2002)MathSciNetCrossRefMATH Fletcher, R., Leyffer, S., Toint, PhL: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13, 44–59 (2002)MathSciNetCrossRefMATH
9.
Zurück zum Zitat Shen, C., Leyffer, S., Fletcher, R.: A nonmonotone filter method for nonlinear optimization. Comput. Optim. Appl. 52, 583–607 (2012)MathSciNetCrossRefMATH Shen, C., Leyffer, S., Fletcher, R.: A nonmonotone filter method for nonlinear optimization. Comput. Optim. Appl. 52, 583–607 (2012)MathSciNetCrossRefMATH
10.
Zurück zum Zitat Gould, N.I.M., Loh, Y., Robinson, D.P.: A filter method with unified step computation for nonlinear optimization. SIAM J. Optim. 24, 175–209 (2014)MathSciNetCrossRefMATH Gould, N.I.M., Loh, Y., Robinson, D.P.: A filter method with unified step computation for nonlinear optimization. SIAM J. Optim. 24, 175–209 (2014)MathSciNetCrossRefMATH
11.
Zurück zum Zitat Bielschowsky, R.H., Gomes, F.A.M.: Dynamic control of infeasibility in equalitly constrained optimization. SIAM J. Optim. 19, 1299–1325 (2008)MathSciNetCrossRefMATH Bielschowsky, R.H., Gomes, F.A.M.: Dynamic control of infeasibility in equalitly constrained optimization. SIAM J. Optim. 19, 1299–1325 (2008)MathSciNetCrossRefMATH
12.
Zurück zum Zitat Gould, N.I.M., Toint, PhL: Nonlinear programming without a penalty function or a filter. Math. Program. 122, 155–196 (2010)MathSciNetCrossRefMATH Gould, N.I.M., Toint, PhL: Nonlinear programming without a penalty function or a filter. Math. Program. 122, 155–196 (2010)MathSciNetCrossRefMATH
13.
Zurück zum Zitat Zhu, X., Pu, D.: A new double trust regions SQP method without a penalty function of a filter. Comput. Appl. Math. 31, 407–432 (2012)MathSciNetCrossRefMATH Zhu, X., Pu, D.: A new double trust regions SQP method without a penalty function of a filter. Comput. Appl. Math. 31, 407–432 (2012)MathSciNetCrossRefMATH
14.
Zurück zum Zitat Liu, X., Yuan, Y.: A sequential quadratic programming method without a penalty function or a filter for nonlinear equality constrained optimization. SIAM J. Optim. 21, 545–571 (2011)MathSciNetCrossRefMATH Liu, X., Yuan, Y.: A sequential quadratic programming method without a penalty function or a filter for nonlinear equality constrained optimization. SIAM J. Optim. 21, 545–571 (2011)MathSciNetCrossRefMATH
15.
Zurück zum Zitat Shen, C., Zhang, L., Wang, B., Shao, W.: Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization. Comput. Optim. Appl. 59, 435–473 (2014)MathSciNetCrossRefMATH Shen, C., Zhang, L., Wang, B., Shao, W.: Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization. Comput. Optim. Appl. 59, 435–473 (2014)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Powell, M.J.D.: A hybrid method for nonlinear equations. In: Rabinowitz, P. (ed.) Numerical Methods for Nonlinear Algebraic Equations, pp. 87–114. Gordon and Breach, London (1970) Powell, M.J.D.: A hybrid method for nonlinear equations. In: Rabinowitz, P. (ed.) Numerical Methods for Nonlinear Algebraic Equations, pp. 87–114. Gordon and Breach, London (1970)
17.
Zurück zum Zitat Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626–637 (1983)MathSciNetCrossRefMATH Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626–637 (1983)MathSciNetCrossRefMATH
18.
Zurück zum Zitat Gould, N.I.M., Lucidi, S., Roma, M., Toint, PhL: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9, 504–525 (1999)MathSciNetCrossRefMATH Gould, N.I.M., Lucidi, S., Roma, M., Toint, PhL: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9, 504–525 (1999)MathSciNetCrossRefMATH
19.
Zurück zum Zitat Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)MATH Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)MATH
20.
Zurück zum Zitat Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99–131 (2005)MathSciNetCrossRefMATH Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99–131 (2005)MathSciNetCrossRefMATH
21.
Zurück zum Zitat Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, revisited. Technical Report TR/PA/01/04, CERFACS, Toulouse, France (2003) Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, revisited. Technical Report TR/PA/01/04, CERFACS, Toulouse, France (2003)
22.
Metadaten
Titel
On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization
verfasst von
Xiaojing Zhu
Publikationsdatum
01.02.2016
Verlag
Springer Berlin Heidelberg
Erschienen in
Journal of Applied Mathematics and Computing / Ausgabe 1-2/2016
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-015-0870-1

Weitere Artikel der Ausgabe 1-2/2016

Journal of Applied Mathematics and Computing 1-2/2016 Zur Ausgabe

Original Research

On Abelian codes over