default search action
Saïd Hilout
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j43]Ioannis K. Argyros, Saïd Hilout:
The majorant method in the theory of Newton-Kantorovich approximations and generalized Lipschitz conditions. J. Comput. Appl. Math. 291: 332-347 (2016) - 2015
- [j42]Ioannis K. Argyros, Miguel Ángel Hernández-Verón, Saïd Hilout, Natalia Romero Álvarez:
Directional Chebyshev-type methods for solving equations. Math. Comput. 84(292): 815-830 (2015) - 2014
- [j41]Ioannis K. Argyros, Saïd Hilout, Ángel Alberto Magreñán
:
Robust semi-local convergence analysis for inexact Newton method. Appl. Math. Comput. 227: 741-754 (2014) - [j40]Sergio Amat, Ioannis K. Argyros, Sonia Busquier, Rodrigo A. Castro
Newton-type methods on Riemannian manifolds under Kantorovich-type conditions. Appl. Math. Comput. 227: 762-787 (2014) - [j39]Ioannis K. Argyros, Saïd Hilout:
Weaker convergence for Newton's method under Hölder differentiability. Int. J. Comput. Math. 91(6): 1351-1369 (2014) - [j38]Ioannis K. Argyros, Saïd Hilout, Sanjay Kumar Khattri
Expanding the applicability of Newton's method using Smale's α-theory. J. Comput. Appl. Math. 261: 183-200 (2014) - [j37]Sergio Amat, Ioannis K. Argyros, Sonia Busquier, Saïd Hilout:
Expanding the Applicability of High-Order Traub-Type Iterative Procedures. J. Optim. Theory Appl. 161(3): 837-852 (2014) - 2013
- [j36]Sergio Amat, Ioannis K. Argyros, Sonia Busquier, Rodrigo A. Castro
On a bilinear operator free third order method on Riemannian manifolds. Appl. Math. Comput. 219(14): 7429-7444 (2013) - [j35]Ioannis K. Argyros, Saïd Hilout:
Extending the applicability of Newton's method on Lie groups. Appl. Math. Comput. 219(20): 10355-10365 (2013) - [j34]Ioannis K. Argyros, Sanjay Kumar Khattri
Expanding the applicability of Inexact Newton Methods under Smale's (α, γ)-theory. Appl. Math. Comput. 224: 224-237 (2013) - [j33]Ioannis K. Argyros, Saïd Hilout:
On an improved convergence analysis of Newton's method. Appl. Math. Comput. 225: 372-386 (2013) - [j32]Ioannis K. Argyros, Saïd Hilout:
On the local convergence of fast two-step Newton-like methods for solving nonlinear equations. J. Comput. Appl. Math. 245: 1-9 (2013) - [j31]Ioannis K. Argyros, Saïd Hilout:
Improved local convergence analysis of inexact Gauss-Newton like methods under the majorant condition in Banach spaces. J. Frankl. Inst. 350(6): 1531-1544 (2013) - [j30]Ioannis K. Argyros, Saïd Hilout:
Directional Secant-Type Methods for Solving Equations. J. Optim. Theory Appl. 157(2): 462-485 (2013) - [j29]Ioannis K. Argyros, Saïd Hilout:
Estimating upper bounds on the limit points of majorizing sequences for Newton's method. Numer. Algorithms 62(1): 115-132 (2013) - 2012
- [j28]Ioannis K. Argyros, Saïd Hilout:
On the semilocal convergence of damped Newton's method. Appl. Math. Comput. 219(5): 2808-2824 (2012) - [j27]Ioannis K. Argyros, Saïd Hilout:
New conditions for the convergence of Newton-like methods and applications. Appl. Math. Comput. 219(6): 3279-3289 (2012) - [j26]Ioannis K. Argyros, Saïd Hilout:
Weaker conditions for the convergence of Newton's method. J. Complex. 28(3): 364-387 (2012) - [j25]Ioannis K. Argyros, Saïd Hilout:
Majorizing sequences for iterative procedures in Banach spaces. J. Complex. 28(5-6): 562-581 (2012) - [j24]Ioannis K. Argyros, Saïd Hilout:
Improved local convergence of Newton's method under weak majorant condition. J. Comput. Appl. Math. 236(7): 1892-1902 (2012) - [j23]Ioannis K. Argyros, Saïd Hilout:
Majorizing sequences for iterative methods. J. Comput. Appl. Math. 236(7): 1947-1960 (2012) - [j22]Ioannis K. Argyros, Saïd Hilout:
Secant-type methods and nondiscrete induction. Numer. Algorithms 61(3): 397-412 (2012) - 2011
- [j21]Ioannis K. Argyros, Saïd Hilout:
Convergence of Directional Methods under mild differentiability and applications. Appl. Math. Comput. 217(21): 8731-8746 (2011) - [j20]Ioannis K. Argyros, Saïd Hilout:
Weak convergence conditions for Inexact Newton-type methods. Appl. Math. Comput. 218(6): 2800-2809 (2011) - [j19]Ioannis K. Argyros, Saïd Hilout:
Extending the applicability of Secant methods and nondiscrete induction. Appl. Math. Comput. 218(7): 3238-3246 (2011) - [j18]Yeol Je Cho, Ioannis K. Argyros, Saïd Hilout:
Extended sufficient semilocal convergence for the Secant method. Comput. Math. Appl. 62(2): 599-610 (2011) - [j17]Ioannis K. Argyros, Saïd Hilout:
A unifying theorem for Newton's method on spaces with a convergence structure. J. Complex. 27(1): 39-54 (2011) - [j16]Ioannis K. Argyros, J. A. Ezquerro
On the semilocal convergence of efficient Chebyshev-Secant-type methods. J. Comput. Appl. Math. 235(10): 3195-3206 (2011) - [j15]Ioannis K. Argyros, Saïd Hilout:
On the solution of systems of equations with constant rank derivatives. Numer. Algorithms 57(2): 235-253 (2011) - [j14]Ioannis K. Argyros, Saïd Hilout:
Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions. Numer. Algorithms 58(1): 23-52 (2011) - [j13]Hongmin Ren, Ioannis K. Argyros, Saïd Hilout:
A derivative free iterative method for solving least squares problems. Numer. Algorithms 58(4): 555-571 (2011) - 2010
- [j12]Ioannis K. Argyros, Yeol Je Cho, Saïd Hilout:
On the midpoint method for solving equations. Appl. Math. Comput. 216(8): 2321-2332 (2010) - [j11]Ioannis K. Argyros, Saïd Hilout:
A unified approach for the convergence of certain numerical algorithms, using recurrent functions. Computing 90(3-4): 131-164 (2010) - [j10]Ioannis K. Argyros, Saïd Hilout:
On the convergence of Newton-type methods using recurrent functions. Int. J. Comput. Math. 87(14): 3273-3296 (2010) - [j9]Ioannis K. Argyros, Saïd Hilout:
Improved generalized differentiability conditions for Newton-like methods. J. Complex. 26(3): 316-333 (2010) - [j8]Ioannis K. Argyros, Saïd Hilout:
Inexact Newton-type methods. J. Complex. 26(6): 577-590 (2010) - [j7]Ioannis K. Argyros, Saïd Hilout:
Extending the Newton-Kantorovich hypothesis for solving equations. J. Comput. Appl. Math. 234(10): 2993-3006 (2010) - [j6]Ioannis K. Argyros, Saïd Hilout:
A Kantorovich-type convergence analysis of the Newton-Josephy method for solving variational inequalities. Numer. Algorithms 55(4): 447-466 (2010) - [j5]Ioannis K. Argyros, Saïd Hilout:
A convergence analysis for directional two-step Newton methods. Numer. Algorithms 55(4): 503-528 (2010)
2000 – 2009
- 2009
- [j4]Ioannis K. Argyros, Saïd Hilout:
On the weakening of the convergence of Newton's method using recurrent functions. J. Complex. 25(6): 530-543 (2009) - [j3]Ioannis K. Argyros, Saïd Hilout:
On the convergence of Newton-type methods under mild differentiability conditions. Numer. Algorithms 52(4): 701-726 (2009) - 2008
- [j2]Ioannis K. Argyros, Saïd Hilout:
Local convergence of Newton-like methods for generalized equations. Appl. Math. Comput. 197(2): 507-514 (2008) - [j1]Ioannis K. Argyros, Saïd Hilout:
A Fréchet derivative-free cubically convergent method for set-valued maps. Numer. Algorithms 48(4): 361-371 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: