Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/15454
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArgyros M.I.
dc.contributor.authorArgyros G.I.
dc.contributor.authorArgyros I.K.
dc.contributor.authorRegmi S.
dc.contributor.authorGeorge S.
dc.date.accessioned2021-05-05T10:27:06Z-
dc.date.available2021-05-05T10:27:06Z-
dc.date.issued2020
dc.identifier.citationApplied System Innovation Vol. 3 , 3 , p. 1 - 6en_US
dc.identifier.urihttps://doi.org/10.3390/asi3030030
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/15454-
dc.description.abstractA 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.titleExtending the applicability of newton’s algorithm with projections for solving generalized equationsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.