Articles de revues : « Newton-type method »

1

Fischer, A. « A special newton-type optimization method ». Optimization 24, n^o 3-4 (janvier 1992) : 269–84. http://dx.doi.org/10.1080/02331939208843795.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Păvăloiu, Ion, et Emil Cătinaş. « On an Aitken–Newton type method ». Numerical Algorithms 62, n^o 2 (6 mai 2012) : 253–60. http://dx.doi.org/10.1007/s11075-012-9577-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Păvăloiu, I., et E. Cătinaş. « On a Newton–Steffensen type method ». Applied Mathematics Letters 26, n^o 6 (juin 2013) : 659–63. http://dx.doi.org/10.1016/j.aml.2013.01.003.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Ramm, A. G. « On the DSM Newton-type method ». Journal of Applied Mathematics and Computing 38, n^o 1-2 (9 juin 2011) : 523–33. http://dx.doi.org/10.1007/s12190-011-0494-z.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Jnawali, Jivandhar. « New Modified Newton Type Iterative Methods ». Nepal Journal of Mathematical Sciences 2, n^o 1 (30 avril 2021) : 17–24. http://dx.doi.org/10.3126/njmathsci.v2i1.36559.

Texte intégral

Résumé :

In this work, we present two Newton type iterative methods for finding the solution of nonlinear equations of single variable. One is obtained as variant of McDougall and Wotherspoon method, and another is obtained by amalgamation of Potra and Pta’k method and our newly introduced method. The order of convergence of these methods are 1 + √2 and 3.5615. Some numerical examples are given to compare the performance of these methods with some similar existing methods.

Styles APA, Harvard, Vancouver, ISO, etc.

6

PAVALOIU, ION. « On an Aitken-Steffensen-Newton type method ». Carpathian Journal of Mathematics 34, n^o 1 (2018) : 85–92. http://dx.doi.org/10.37193/cjm.2018.01.09.

Texte intégral

Résumé :

We consider an Aitken-Steffensen type method in which the nodes are controlled by Newton and two-step Newton iterations. We prove a local convergence result showing the q-convergence order 7 of the iterations. Under certain supplementary conditions, we obtain monotone convergence of the iterations, providing an alternative to the usual ball attraction theorems. Numerical examples show that this method may, in some cases, have larger (possibly sided) convergence domains than other methods with similar convergence orders.

Styles APA, Harvard, Vancouver, ISO, etc.

7

Vijesh, V. Antony, et P. V. Subrahmanyam. « A Newton-type method and its application ». International Journal of Mathematics and Mathematical Sciences 2006 (2006) : 1–9. http://dx.doi.org/10.1155/ijmms/2006/23674.

Texte intégral

Résumé :

We prove an existence and uniqueness theorem for solving the operator equationF(x)+G(x)=0, whereFis a continuous and Gâteaux differentiable operator and the operatorGsatisfies Lipschitz condition on an open convex subset of a Banach space. As corollaries, a recent theorem of Argyros (2003) and the classical convergence theorem for modified Newton iterates are deduced. We further obtain an existence theorem for a class of nonlinear functional integral equations involving the Urysohn operator.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Bayrak, Mine Aylin, Ali Demir et Ebru Ozbilge. « On Fractional Newton-Type Method for Nonlinear Problems ». Journal of Mathematics 2022 (21 novembre 2022) : 1–10. http://dx.doi.org/10.1155/2022/7070253.

Texte intégral

Résumé :

The current manuscript is concerned with the development of the Newton–Raphson method, playing a significant role in mathematics and various other disciplines such as optimization, by using fractional derivatives and fractional Taylor series expansion. The development and modification of the Newton–Raphson method allow us to establish two new methods, which are called first- and second-order fractional Newton–Raphson (FNR) methods. We provide convergence analysis of first- and second-order fractional methods and give a general condition for the convergence of higher-order FNR. Finally, some illustrative examples are considered to confirm the accuracy and effectiveness of both methods.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Jnawali, Jivandhar, et Chet Raj Bhatta. « Iterative Methods for Solving Nonlinear Equations with Fourth-Order Convergence ». Tribhuvan University Journal 30, n^o 2 (1 décembre 2016) : 65–72. http://dx.doi.org/10.3126/tuj.v30i2.25548.

Texte intégral

Résumé :

In this paper, we obtain fourth order iterative method for solving nonlinear equations by combining arithmetic mean Newton method, harmonic mean Newton method and midpoint Newton method uniquely. Also, some variant of Newton type methods based on inverse function have been developed. These methods are free from second order derivatives.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Zhao, Wan-Chen, et Xin-Hui Shao. « New matrix splitting iteration method for generalized absolute value equations ». AIMS Mathematics 8, n^o 5 (2023) : 10558–78. http://dx.doi.org/10.3934/math.2023536.

Texte intégral

Résumé :

<abstract><p>In this paper, a relaxed Newton-type matrix splitting (RNMS) iteration method is proposed for solving the generalized absolute value equations, which includes the Picard method, the modified Newton-type (MN) iteration method, the shift splitting modified Newton-type (SSMN) iteration method and the Newton-based matrix splitting (NMS) iteration method. We analyze the sufficient convergence conditions of the RNMS method. Lastly, the efficiency of the RNMS method is analyzed by numerical examples involving symmetric and non-symmetric matrices.</p></abstract>

Styles APA, Harvard, Vancouver, ISO, etc.

11

Jnawali, Jivandhar. « Higher Order Convergent Newton Type Iterative Methods ». Journal of Nepal Mathematical Society 1, n^o 2 (5 août 2018) : 32–39. http://dx.doi.org/10.3126/jnms.v1i2.41488.

Texte intégral

Résumé :

Newton method is one of the most widely used numerical methods for solving nonlinear equations. McDougall and Wotherspoon [Appl. Math. Lett., 29 (2014), 20-25] modified this method in predictor-corrector form and get an order of convergence 1+√2. More on the PDF

Styles APA, Harvard, Vancouver, ISO, etc.

12

Gugat, Matin. « Semi-infinite terminal problems : a newton type method ». Optimization 44, n^o 1 (janvier 1998) : 25–48. http://dx.doi.org/10.1080/02331939808844398.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

13

Amat, S., S. Busquier, A. Escudero et F. Manzano. « A wavelet adaptive two-step Newton type method ». Journal of the Franklin Institute 348, n^o 5 (juin 2011) : 823–31. http://dx.doi.org/10.1016/j.jfranklin.2011.02.006.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Amat, S., Á. A. Magreñán et N. Romero. « On a two-step relaxed Newton-type method ». Applied Mathematics and Computation 219, n^o 24 (août 2013) : 11341–47. http://dx.doi.org/10.1016/j.amc.2013.04.061.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Santos, P. J. S., P. S. M. Santos et S. Scheimberg. « A proximal Newton-type method for equilibrium problems ». Optimization Letters 12, n^o 5 (10 octobre 2017) : 997–1009. http://dx.doi.org/10.1007/s11590-017-1204-z.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

Fliege, Jörg, Andrey Tin et Alain Zemkoho. « Gauss–Newton-type methods for bilevel optimization ». Computational Optimization and Applications 78, n^o 3 (10 janvier 2021) : 793–824. http://dx.doi.org/10.1007/s10589-020-00254-3.

Texte intégral

Résumé :

AbstractThis article studies Gauss–Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function reformulation of bilevel programs and consider necessary optimality conditions under appropriate assumptions. First, under strict complementarity for upper- and lower-level feasibility constraints, we prove the convergence of a Gauss–Newton-type method in computing points satisfying these optimality conditions under additional tractable qualification conditions. Potential approaches to address the shortcomings of the method are then proposed, leading to alternatives such as the pseudo or smoothing Gauss–Newton-type methods for bilevel optimization. Our numerical experiments conducted on 124 examples from the recently released Bilevel Optimization LIBrary (BOLIB) compare the performance of our method under different scenarios and show that it is a tractable approach to solve bilevel optimization problems with continuous variables.

Styles APA, Harvard, Vancouver, ISO, etc.

17

Candelario, Giro, Alicia Cordero et Juan R. Torregrosa. « Multipoint Fractional Iterative Methods with (2α + 1)th-Order of Convergence for Solving Nonlinear Problems ». Mathematics 8, n^o 3 (20 mars 2020) : 452. http://dx.doi.org/10.3390/math8030452.

Texte intégral

Résumé :

In the recent literature, some fractional one-point Newton-type methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper, we introduce a new fractional Newton-type method with order of convergence α + 1 and compare it with the existing fractional Newton method with order 2 α . Moreover, we also introduce a multipoint fractional Traub-type method with order 2 α + 1 and compare its performance with that of its first step. Some numerical tests and analysis of the dependence on the initial estimations are made for each case, including a comparison with classical Newton ( α = 1 of the first step of the class) and classical Traub’s scheme ( α = 1 of fractional proposed multipoint method). In this comparison, some cases are found where classical Newton and Traub’s methods do not converge and the proposed methods do, among other advantages.

Styles APA, Harvard, Vancouver, ISO, etc.

18

Zhou, Wen, et Jisheng Kou. « Third-Order Newton-Type Methods Combined with Vector Extrapolation for Solving Nonlinear Systems ». Abstract and Applied Analysis 2014 (2014) : 1–8. http://dx.doi.org/10.1155/2014/601745.

Texte intégral

Résumé :

We present a third-order method for solving the systems of nonlinear equations. This method is a Newton-type scheme with the vector extrapolation. We establish the local and semilocal convergence of this method. Numerical results show that the composite method is more robust and efficient than a number of Newton-type methods with the other vector extrapolations.

Styles APA, Harvard, Vancouver, ISO, etc.

19

Bisheh-Niasar, Morteza, et Abbas Saadatmandi. « Some novel Newton-type methods for solving nonlinear equations ». Boletim da Sociedade Paranaense de Matemática 38, n^o 3 (18 février 2019) : 111–23. http://dx.doi.org/10.5269/bspm.v38i3.37351.

Texte intégral

Résumé :

The aim of this paper is to present a new nonstandard Newton iterative method for solving nonlinear equations. The convergence of the proposed method is proved and it is shown that the new method has cubic convergence. Furthermore, two new multi-point methods with sixth-order convergence, based on the introduced method, are presented. Also, we describe the basins of attraction for these methods. Finally, some numerical examples are given to show the performance of our methods by comparing with some other methods available in the literature

Styles APA, Harvard, Vancouver, ISO, etc.

20

Rashid, MH, et A. Sarder. « Convergence of the Newton-Type Method for Generalized Equations ». GANIT : Journal of Bangladesh Mathematical Society 35 (28 juin 2016) : 27–40. http://dx.doi.org/10.3329/ganit.v35i0.28565.

Texte intégral

Résumé :

Let X and Y be real or complex Banach spaces. Suppose that f: X->Y is a Frechet differentiable function and F: X => 2Yis a set-valued mapping with closed graph. In the present paper, we study the Newton-type method for solving generalized equation 0 ? f(x) + F(x). We prove the existence of the sequence generated by the Newton-type method and establish local convergence of the sequence generated by this method for generalized equation.GANIT J. Bangladesh Math. Soc.Vol. 35 (2015) 27-40

Styles APA, Harvard, Vancouver, ISO, etc.

21

Guo, Miao, et Qingbiao Wu. « Two effective inexact iteration methods for solving the generalized absolute value equations ». AIMS Mathematics 7, n^o 10 (2022) : 18675–89. http://dx.doi.org/10.3934/math.20221027.

Texte intégral

Résumé :

<abstract><p>Modified Newton-type methods are efficient for addressing the generalized absolute value equations. In this paper, to further speed up the modified Newton-type methods, two new inexact modified Newton-type iteration methods are proposed. The sufficient conditions for the convergence of the two proposed inexact iteration methods are given. Moreover, to demonstrate the efficacy of the new method, several numerical examples are provided.</p></abstract>

Styles APA, Harvard, Vancouver, ISO, etc.

22

J. Wolters, Hans. « A Newton-type method for computing best segment approximations ». Communications on Pure & ; Applied Analysis 3, n^o 1 (2004) : 133–48. http://dx.doi.org/10.3934/cpaa.2004.3.133.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

Jnawali, Jivandhar. « A Newton Type Iterative Method with Fourth-order Convergence ». Journal of the Institute of Engineering 12, n^o 1 (6 mars 2017) : 87–95. http://dx.doi.org/10.3126/jie.v12i1.16729.

Texte intégral

Résumé :

The aim of this paper is to propose a fourth-order Newton type iterative method for solving nonlinear equations in a single variable. We obtained this method by combining the iterations of contra harmonic Newton’s method with secant method. The proposed method is free from second order derivative. Some numerical examples are given to illustrate the performance and to show this method’s advantage over other compared methods.Journal of the Institute of Engineering, 2016, 12 (1): 87-95

Styles APA, Harvard, Vancouver, ISO, etc.

24

Lee, Joon-Ho, Sung-Woo Cho et Hyung Seok Kim. « Newton-type method in spectrum estimaion-based AOA estimation ». IEICE Electronics Express 9, n^o 12 (2012) : 1036–43. http://dx.doi.org/10.1587/elex.9.1036.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Amat, S., M. J. Légaz et P. Pedregal. « On a Newton-Type Method for Differential-Algebraic Equations ». Journal of Applied Mathematics 2012 (2012) : 1–15. http://dx.doi.org/10.1155/2012/718608.

Texte intégral

Résumé :

This paper deals with the approximation of systems of differential-algebraic equations based on a certain error functional naturally associated with the system. In seeking to minimize the error, by using standard descent schemes, the procedure can never get stuck in local minima but will always and steadily decrease the error until getting to the solution sought. Starting with an initial approximation to the solution, we improve it by adding the solution of some associated linear problems, in such a way that the error is significantly decreased. Some numerical examples are presented to illustrate the main theoretical conclusions. We should mention that we have already explored, in some previous papers (Amat et al., in press, Amat and Pedregal, 2009, and Pedregal, 2010), this point of view for regular problems. However, the main hypotheses in these papers ask for some requirements that essentially rule out the application to singular problems. We are also preparing a much more ambitious perspective for the theoretical analysis of nonlinear DAEs based on this same approach.

Styles APA, Harvard, Vancouver, ISO, etc.

26

Basu, Dhiman. « Composite Fourth Order Newton Type Method for Simple Root ». International Journal for Computational Methods in Engineering Science and Mechanics 9, n^o 4 (30 mai 2008) : 201–10. http://dx.doi.org/10.1080/15502280802069889.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

Tao, Yuxi, et Xiaofeng Wan. « A Newton Type Iterative Method with Seventh-Order Convergence ». Journal of Physics : Conference Series 1648 (octobre 2020) : 042123. http://dx.doi.org/10.1088/1742-6596/1648/4/042123.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Azé, D., et C. C. Chou. « On a Newton Type Iterative Method for Solving Inclusions ». Mathematics of Operations Research 20, n^o 4 (novembre 1995) : 790–800. http://dx.doi.org/10.1287/moor.20.4.790.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

29

Zhou, Guanglu, et Liqun Qi. « On the convergence of an inexact Newton-type method ». Operations Research Letters 34, n^o 6 (novembre 2006) : 647–52. http://dx.doi.org/10.1016/j.orl.2005.11.001.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

30

Fang, Liang, Guoping He et Zhongyong Hu. « A cubically convergent Newton-type method under weak conditions ». Journal of Computational and Applied Mathematics 220, n^o 1-2 (octobre 2008) : 409–12. http://dx.doi.org/10.1016/j.cam.2007.08.013.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

31

Amat, S., S. Busquier et S. Plaza. « Chaotic dynamics of a third-order Newton-type method ». Journal of Mathematical Analysis and Applications 366, n^o 1 (juin 2010) : 24–32. http://dx.doi.org/10.1016/j.jmaa.2010.01.047.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Cárdenas, Elkin, Rodrigo Castro et Willy Sierra. « A Newton-type midpoint method with high efficiency index ». Journal of Mathematical Analysis and Applications 491, n^o 2 (novembre 2020) : 124381. http://dx.doi.org/10.1016/j.jmaa.2020.124381.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

33

Amat, S., S. Busquier et Á. A. Magreñán. « Reducing Chaos and Bifurcations in Newton-Type Methods ». Abstract and Applied Analysis 2013 (2013) : 1–10. http://dx.doi.org/10.1155/2013/726701.

Texte intégral

Résumé :

We study the dynamics of some Newton-type iterative methods when they are applied of polynomials degrees two and three. The methods are free of high-order derivatives which are the main limitation of the classical high-order iterative schemes. The iterative schemes consist of several steps of damped Newton's method with the same derivative. We introduce a damping factor in order to reduce thebadzones of convergence. The conclusion is that the damped schemes become real alternative to the classical Newton-type method since both chaos and bifurcations of the original schemes are reduced. Therefore, the new schemes can be utilized to obtain good starting points for the original schemes.

Styles APA, Harvard, Vancouver, ISO, etc.

34

Shen, Jie, Li-Ping Pang et Dan Li. « An Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization ». Abstract and Applied Analysis 2013 (2013) : 1–7. http://dx.doi.org/10.1155/2013/697474.

Texte intégral

Résumé :

An implementable algorithm for solving a nonsmooth convex optimization problem is proposed by combining Moreau-Yosida regularization and bundle and quasi-Newton ideas. In contrast with quasi-Newton bundle methods of Mifflin et al. (1998), we only assume that the values of the objective function and its subgradients are evaluated approximately, which makes the method easier to implement. Under some reasonable assumptions, the proposed method is shown to have a Q-superlinear rate of convergence.

Styles APA, Harvard, Vancouver, ISO, etc.

35

Guo, Pei-Chang. « A Fast Newton-Shamanskii Iteration for a Matrix Equation Arising from M/G/1-Type Markov Chains ». Mathematical Problems in Engineering 2017 (2017) : 1–8. http://dx.doi.org/10.1155/2017/4018239.

Texte intégral

Résumé :

For the nonlinear matrix equations arising in the analysis of M/G/1-type and GI/M/1-type Markov chains, the minimal nonnegative solution G or R can be found by Newton-like methods. We prove monotone convergence results for the Newton-Shamanskii iteration for this class of equations. Starting with zero initial guess or some other suitable initial guess, the Newton-Shamanskii iteration provides a monotonically increasing sequence of nonnegative matrices converging to the minimal nonnegative solution. A Schur decomposition method is used to accelerate the Newton-Shamanskii iteration. Numerical examples illustrate the effectiveness of the Newton-Shamanskii iteration.

Styles APA, Harvard, Vancouver, ISO, etc.

36

Liang, Ke, Mostafa M. Abdalla et Qin Sun. « A modified Newton-type Koiter-Newton method for tracing the geometrically nonlinear response of structures ». International Journal for Numerical Methods in Engineering 113, n^o 10 (22 novembre 2017) : 1541–60. http://dx.doi.org/10.1002/nme.5709.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

37

Khaksar Haghani, F. « A Third-Order Newton-Type Method for Finding Polar Decomposition ». Advances in Numerical Analysis 2014 (30 septembre 2014) : 1–5. http://dx.doi.org/10.1155/2014/576325.

Texte intégral

Résumé :

It is attempted to present an iteration method for finding polar decomposition. The approach is categorized in the scope of Newton-type methods. Error analysis and rate of convergence are studied. Some illustrations are also given to disclose the numerical behavior of the proposed method.

Styles APA, Harvard, Vancouver, ISO, etc.

38

Kumar, Manoj. « On an new Open type variant of Newton´s method ». Journal of Applied Mathematics, Statistics and Informatics 10, n^o 2 (1 décembre 2014) : 21–31. http://dx.doi.org/10.2478/jamsi-2014-0010.

Texte intégral

Résumé :

Abstract The aim of the present paper is to introduce and investigate a new Open type variant of Newton's method for solving nonlinear equations. The order of convergence of the proposed method is three. In addition to numerical tests verifying the theory, a comparison of the results for the proposed method and some of the existing ones have also been given.

Styles APA, Harvard, Vancouver, ISO, etc.

39

Ohtsuka, Toshiyuki. « Quasi-Newton-Type Continuation Method for Nonlinear Receding Horizon Control ». Journal of Guidance, Control, and Dynamics 25, n^o 4 (juillet 2002) : 685–92. http://dx.doi.org/10.2514/2.4935.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Pieraccini, S. « Hybrid Newton-Type Method for a Class of Semismooth Equations ». Journal of Optimization Theory and Applications 112, n^o 2 (février 2002) : 381–402. http://dx.doi.org/10.1023/a:1013610108041.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

Bai, Zheng-Jian, et Shufang Xu. « An inexact Newton-type method for inverse singular value problems ». Linear Algebra and its Applications 429, n^o 2-3 (juillet 2008) : 527–47. http://dx.doi.org/10.1016/j.laa.2008.03.008.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

H�u�ler, W. M. « A Kantorovich-type convergence analysis for the Gauss-Newton-Method ». Numerische Mathematik 48, n^o 1 (janvier 1986) : 119–25. http://dx.doi.org/10.1007/bf01389446.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

43

Zhang, Xinzhen, Hefeng Jiang et Yiju Wang. « A smoothing Newton-type method for generalized nonlinear complementarity problem ». Journal of Computational and Applied Mathematics 212, n^o 1 (février 2008) : 75–85. http://dx.doi.org/10.1016/j.cam.2006.03.042.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Hoppe, R. H. W., S. I. Petrova et V. Schulz. « Primal-Dual Newton-Type Interior-Point Method for Topology Optimization ». Journal of Optimization Theory and Applications 114, n^o 3 (septembre 2002) : 545–71. http://dx.doi.org/10.1023/a:1016070928600.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

45

Thukral, R. « Introduction to a Newton-type method for solving nonlinear equations ». Applied Mathematics and Computation 195, n^o 2 (février 2008) : 663–68. http://dx.doi.org/10.1016/j.amc.2007.05.013.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

46

Deng, Haoyang, et Toshiyuki Ohtsuka. « A parallel Newton-type method for nonlinear model predictive control ». Automatica 109 (novembre 2019) : 108560. http://dx.doi.org/10.1016/j.automatica.2019.108560.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

He, Guo-qiang, et Ze-hong Meng. « A Newton type iterative method for heat-conduction inverse problems ». Applied Mathematics and Mechanics 28, n^o 4 (avril 2007) : 531–39. http://dx.doi.org/10.1007/s10483-007-0414-y.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Fischer, A. « A Newton-type method for positive-semidefinite linear complementarity problems ». Journal of Optimization Theory and Applications 86, n^o 3 (septembre 1995) : 585–608. http://dx.doi.org/10.1007/bf02192160.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

49

Argyros, Ioannis K., et Saïd Hilout. « An improved local convergence analysis for Newton–Steffensen-type method ». Journal of Applied Mathematics and Computing 32, n^o 1 (27 janvier 2009) : 111–18. http://dx.doi.org/10.1007/s12190-009-0236-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

50

Khaton, M., M. Rashid et M. Hossain. « Convergence Properties of Extended Newton-type Iteration Method for Generalized Equations ». Journal of Mathematics Research 10, n^o 4 (19 avril 2018) : 1. http://dx.doi.org/10.5539/jmr.v10n4p1.

Texte intégral

Résumé :

In this paper, we introduce and study the extended Newton-type method for solving generalized equation $0\in f(x)+g(x)+\mathcal F(x)$, where $f:\Omega\subseteq\mathcal X\to \mathcal Y$ is Fr\'{e}chet differentiable in a neighborhood $\Omega$ of a point $\bar{x}$ in $\mathcal X$, $g:\Omega\subseteq \mathcal X\to \mathcal Y$ is linear and differentiable at a point $\bar{x}$, and $\mathcal F$ is a set-valued mapping with closed graph acting in Banach spaces $\mathcal X$ and $\mathcal Y$. Semilocal and local convergence of the extended Newton-type method are analyzed.

Styles APA, Harvard, Vancouver, ISO, etc.

Articles de revues sur le sujet « Newton-type method »

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres