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

Simple item page
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.accessioned2026-02-05T09:28:13Z
dc.date.issued2020
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.
dc.identifier.citationApplied System Innovation, 2020, 3, 3, pp. 1-6
dc.identifier.urihttps://doi.org/10.3390/asi3030030
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/23731
dc.publisherMDPI AG diversity@mdpi.com
dc.subjectConvergence ball
dc.subjectEuclidean space
dc.subjectGeneralized equation
dc.subjectLipschitz condition
dc.subjectNewton’s algorithm
dc.titleExtending the applicability of newton’s algorithm with projections for solving generalized equations

Files

Collections

Journal Articles