nach oben

Calcolo

Erschienen in:

01.06.2016

A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints

verfasst von: X. Y. Wang, S. J. Li, X. P. Kou

Erschienen in: Calcolo | Ausgabe 2/2016

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

In this paper, a self-adaptive three-term conjugate gradient method is proposed for solving monotone nonlinear equations with convex constraints. Under milder conditions, the global convergence of the method is proved. Numerical experiments reported in this paper illustrate that the method is stable and efficient for monotone nonlinear equations, especially for the large-scale problems with convex constraints.

Nächster Artikel On streamline diffusion schemes for the one and one-half dimensional relativistic Vlasov–Maxwell system

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren

Al-Baali, M., Narushima, Y., Yabe, H.: A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization. Comput. Optim. Appl. (2014). doi:10.1007/s10589-014-9662-z MathSciNetMATH

Bellavia, S., Macconi, M., Morini, B.: STRSCNE: a scaled trust-region solver for constrained nonlinear equations. Comput. Optim. Appl. 28, 31–50 (2004)MathSciNetCrossRefMATH

Bongartz, K.E., Conn, A.R., Gould, N.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123–160 (1995)CrossRefMATH

Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)MathSciNetCrossRefMATH

Hager, W.W., Zhang, H.C.: A survey of nonlinear conjugate gradient method. Pac. J. Optim. 2, 35–58 (2006)MathSciNetMATH

Hager, W.W., Zhang, H.C.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170–192 (2005)MathSciNetCrossRefMATH

Han, D.R., Sun, W.Y.: A new modified Goldstein–Levitin–Polyak projection method for variational inequality problems. Comput. Math. Appl. 47, 1817–1825 (2004)MathSciNetCrossRefMATH

He, B.S., Liao, L.Z., Wang, X.: Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments. Comput. Optim. Appl. 51, 681–708 (2012)MathSciNetCrossRefMATH

He, B.S., Yang, H., Wang, S.L.: Alternationg direction method with self-adaptive penalty parameters for monotone variational inequalites. J. Optim. Theory Appl. 106, 337–356 (2000)MathSciNetCrossRef

10.

Kanzow, C., Yamashita, N., Fukushima, M.: Levenberg–Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints. J. Comput. Appl. Math. 172, 375–397 (2004)MathSciNetCrossRefMATH

11.

Narushima, Y.: A smoothing conjugate gradient method for solving systems of nonsmooth equations. Appl. Math. Comput. 219, 8646–8655 (2013)MathSciNetMATH

12.

Narushima, Y., Yabe, H., Ford, J.A.: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization. SIAM J. Optim. 21, 212–230 (2011)MathSciNetCrossRefMATH

13.

Sugiki, K., Narushima, Y., Yabe, H.: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization. J. Optim. Theory Appl. 153, 733–757 (2012)MathSciNetCrossRefMATH

14.

Solodov, M.V., Svaiter, B.F.: A globally convergent inexact Newton method for systems of monotone equations. In: Fukushima, M., Qi, L. (eds.) Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 355–369. Kluwer Academic Publishers, Norwell (1998)CrossRef

15.

Solodov, M.V., Svaiter, B.F.: A new projection method for variational inequality problems. SIAM J. Control. Optim. 37, 765–776 (1999)MathSciNetCrossRefMATH

16.

Wang, Y.J., Xiu, N.H., Zhang, J.Z.: Modified extragradient method for variational inequalities and verification of solution existence. J. Optim. Theory Appl. 119, 167–183 (2003)MathSciNetCrossRefMATH

17.

Wang, C.Y., Wang, Y.J.: A superlinearly convergent projection method for constrained systems of nonlinear equations. J. Glob. Optim. 44, 283–296 (2009)MathSciNetCrossRefMATH

18.

Wang, C.W., Wang, Y.J., Xu, C.L.: A projection method for a system of nonlinear monotone equations with convex constraints. Math. Meth. Oper. Res. 66, 33–46 (2007)MathSciNetCrossRefMATH

19.

Xiao, Y., Zhu, H.: A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing. J. Math. Anal. Appl. 405, 310–319 (2013)MathSciNetCrossRefMATH

20.

Yu, Z.S., Sun, J., Qin, Y.: A multivariate spectral projected gradient method for bound constrained optimization. J. Comput. Appl. Math. 235, 2263–2269 (2011)MathSciNetCrossRefMATH

21.

Zhang, L., Zhou, W.J., Li, D.H.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22, 697–711 (2007)MathSciNetCrossRefMATH

22.

Zhang, L., Zhou, W.J., Li, D.H.: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629–640 (2006)

23.

Zhang, W.X., Han, D.R., Li, Z.B.: A self-adaptive projection method for solving the multiple-sets split feasibility problem. Inverse Probl. 25 (2009). doi:10.1088/0266-5611/25/11/115001

Titel: A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
verfasst von: X. Y. Wang
S. J. Li
X. P. Kou
Publikationsdatum: 01.06.2016
Verlag: Springer Milan
Erschienen in: Calcolo / Ausgabe 2/2016
Print ISSN: 0008-0624
Elektronische ISSN: 1126-5434
DOI: https://doi.org/10.1007/s10092-015-0140-5

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 2/2016

On a Steffensen-like method for solving nonlinear equations

Creating stable quadrature rules with preassigned points by interpolation

Solving nonlinear equations by a derivative-free form of the King’s family with memory

Lagrange–Hermite interpolation on the real semiaxis

The common (P, Q) generalized reflexive and anti-reflexive solutions to and

A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems

Premium Partner