An Efficient Subspace Minimization Conjugate Gradient Method for Solving Nonlinear Monotone Equations with Convex Constraints

The subspace minimization conjugate gradient (SMCG) methods proposed by Yuan and Store are efficient iterative methods for unconstrained optimization, where the search directions are generated by minimizing the quadratic approximate models of the objective function at the current iterative point. Al...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Taiyong Song, Zexian Liu
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	MDPI AG 2024-03-01
סדרה:	Axioms
נושאים:	nonlinear monotone equations subspace minimization conjugate gradient method convex constraints global convergence R-linear convergence rate
גישה מקוונת:	https://www.mdpi.com/2075-1680/13/3/170
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!