Extending the applicability of newton’s algorithm with projections for solving generalized equations

Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/15454

Full metadata record

DC Field	Value	Language
dc.contributor.author	Argyros M.I.
dc.contributor.author	Argyros G.I.
dc.contributor.author	Argyros I.K.
dc.contributor.author	Regmi S.
dc.contributor.author	George S.
dc.date.accessioned	2021-05-05T10:27:06Z	-
dc.date.available	2021-05-05T10:27:06Z	-
dc.date.issued	2020
dc.identifier.citation	Applied System Innovation Vol. 3 , 3 , p. 1 - 6	en_US
dc.identifier.uri	https://doi.org/10.3390/asi3030030
dc.identifier.uri	http://idr.nitk.ac.in/jspui/handle/123456789/15454	-
dc.description.abstract	A new technique is developed to extend the convergence ball of Newton’s algorithm with projections for solving generalized equations with constraints on the multidimensional Euclidean space. This goal is achieved by locating a more precise region than in earlier studies containing the solution on which the Lipschitz constants are smaller than the ones used in previous studies. These advances are obtained without additional conditions. This technique can be used to extend the usage of other iterative algorithms. Numerical experiments are used to demonstrate the superiority of the new results. © 2020 by the authors. Licensee MDPI, Basel, Switzerland.	en_US
dc.title	Extending the applicability of newton’s algorithm with projections for solving generalized equations	en_US
dc.type	Article	en_US
Appears in Collections:	1. Journal Articles

Files in This Item:

There are no files associated with this item.