Skip to main content
Top
Published in: Journal of Applied Mathematics and Computing 4/2022

28-08-2021 | Original Research

Efficient regularized Newton-type algorithm for solving convex optimization problem

Authors: Shazia Javed, Areeba Khan

Published in: Journal of Applied Mathematics and Computing | Issue 4/2022

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, the subspace properties of trust-region methods are employed to develop a regularized Newton-type (RNT) algorithm for solving convex optimization problem. The proposed RNT algorithm is analyzed for quadratic convergence under the local error bound conditions and global convergence for unconstrained convex optimization problems which may have singular Hessian at the solutions. Afterwards numerical results are presented to show the efficiency and robustness of the proposed algorithm in producing an optimal solution for the given problem.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
1.
go back to reference Bradie, B.: A friendly introduction to numerical analysis. Pearson Education India (2006) Bradie, B.: A friendly introduction to numerical analysis. Pearson Education India (2006)
2.
go back to reference Chong, E.K., Zak, S.H.: An Introduction to Optimization, vol. 76. John Wiley & Sons, New York (2013)MATH Chong, E.K., Zak, S.H.: An Introduction to Optimization, vol. 76. John Wiley & Sons, New York (2013)MATH
3.
go back to reference Dehghan Niri, T., Heydari, M., Hosseini, M.: Correction of trust region method with a new modified newton method. Int. J. Comput. Math. 97(5), 1118–1132 (2020)MathSciNetCrossRef Dehghan Niri, T., Heydari, M., Hosseini, M.: Correction of trust region method with a new modified newton method. Int. J. Comput. Math. 97(5), 1118–1132 (2020)MathSciNetCrossRef
4.
go back to reference Fan, J., Yuan, Y.: A regularized newton method for monotone nonlinear equations and its application. Optim. Methods Softw. 29(1), 102–119 (2014)MathSciNetCrossRef Fan, J., Yuan, Y.: A regularized newton method for monotone nonlinear equations and its application. Optim. Methods Softw. 29(1), 102–119 (2014)MathSciNetCrossRef
5.
go back to reference Kelley, C.T.: Iterative Methods for Optimization, vol. 18. SIAM, Philadelphia (1999)CrossRef Kelley, C.T.: Iterative Methods for Optimization, vol. 18. SIAM, Philadelphia (1999)CrossRef
6.
go back to reference Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Quart. Appl. Math. 2(2), 164–168 (1944)MathSciNetCrossRef Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Quart. Appl. Math. 2(2), 164–168 (1944)MathSciNetCrossRef
7.
go back to reference Li, D.H., Fukushima, M., Qi, L., Yamashita, N.: Regularized newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28(2), 131–147 (2004)MathSciNetCrossRef Li, D.H., Fukushima, M., Qi, L., Yamashita, N.: Regularized newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28(2), 131–147 (2004)MathSciNetCrossRef
8.
go back to reference Li, L., Qin, M., Wang, H.: A regularized newton method with correction for unconstrained convex optimization. Open J. Optim. 5(01), 44 (2016)CrossRef Li, L., Qin, M., Wang, H.: A regularized newton method with correction for unconstrained convex optimization. Open J. Optim. 5(01), 44 (2016)CrossRef
9.
go back to reference Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 11(2), 431–441 (1963)MathSciNetCrossRef Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 11(2), 431–441 (1963)MathSciNetCrossRef
10.
go back to reference Moré, J.J.: The levenberg-marquardt algorithm: implementation and theory. In: Numerical analysis, pp. 105–116 (1978) Moré, J.J.: The levenberg-marquardt algorithm: implementation and theory. In: Numerical analysis, pp. 105–116 (1978)
11.
go back to reference Nashed, M., Chen, X.: Convergence of newton-like methods for singular operator equations using outer inverses. Numerische Mathematik 66(1), 235–257 (1993)MathSciNetCrossRef Nashed, M., Chen, X.: Convergence of newton-like methods for singular operator equations using outer inverses. Numerische Mathematik 66(1), 235–257 (1993)MathSciNetCrossRef
12.
go back to reference Powell, M.J.D.: Convergence properties of a class of minimization algorithms. Nonlinear Program. 2, 1–27 (1975) Powell, M.J.D.: Convergence properties of a class of minimization algorithms. Nonlinear Program. 2, 1–27 (1975)
13.
go back to reference Sun, D.: A regularization newton method for solving nonlinear complementarity problems. Appl. Math. Optim. 40(3), 315–339 (1999)MathSciNetCrossRef Sun, D.: A regularization newton method for solving nonlinear complementarity problems. Appl. Math. Optim. 40(3), 315–339 (1999)MathSciNetCrossRef
14.
go back to reference Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming, vol. 1. Springer Science & Business Media, Cham (2006)MATH Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming, vol. 1. Springer Science & Business Media, Cham (2006)MATH
15.
go back to reference Tseng, P.: Error bounds and superlinear convergence analysis of some newton-type methods in optimization. In: Nonlinear Optimization and Related Topics, pp. 445–462 (2000) Tseng, P.: Error bounds and superlinear convergence analysis of some newton-type methods in optimization. In: Nonlinear Optimization and Related Topics, pp. 445–462 (2000)
Metadata
Title
Efficient regularized Newton-type algorithm for solving convex optimization problem
Authors
Shazia Javed
Areeba Khan
Publication date
28-08-2021
Publisher
Springer Berlin Heidelberg
Published in
Journal of Applied Mathematics and Computing / Issue 4/2022
Print ISSN: 1598-5865
Electronic ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-021-01620-y

Other articles of this Issue 4/2022

Journal of Applied Mathematics and Computing 4/2022 Go to the issue

Premium Partner