Resultats globals: 4 registres trobats en 0.02 segons.
Articles, 4 registres trobats
Articles 4 registres trobats  
1.
13 p, 906.5 KB Newton's method for symmetric quartic polynomials / Campos, Beatriz (Universitat Jaume I. Departament de Matemàtiques) ; Garijo, Antoni (Universitat Rovira i Virgili. Departament d'Enginyeria Informàtica i Matemàtiques) ; Jarque i Ribera, Xavier (Universitat de Barcelona. Departament de Matemàtica Aplicada i Anàlisi) ; Vindel, Pura (Universitat Jaume I. Departament de Matemàtiques)
We investigate the parameter plane of the Newton's method applied to the family of quartic polynomials p_a,b(z)=z^4 az^3 bz^2 az 1, where a and b are real parameters. We divide the parameter plane (a,b) R^2 into twelve open and connected regions where p, p' and p'' have simple roots. [...]
2016 - 10.1016/j.amc.2016.06.021
Applied Mathematics and Computation, Vol. 290 (2016) , p. 326-335  
2.
22 p, 3.0 MB Newton's method on Bring-Jerrard polynomials / Campos, Beatriz (Universitat Jaume I. Departament de Matemàtiques) ; Garijo, Antoni (Universitat Rovira i Virgili. Departament d'Enginyeria Informàtica i Matemàtiques) ; Jarque i Ribera, Xavier (Universitat de Barcelona. Departament de Matemàtica Aplicada i Anàlisi) ; Vindel, Pura (Universitat Jaume I. Departament de Matemàtiques)
In this paper we study the topology of the hyperbolic component of the parameter plane for the Newton's method applied to n-th degree Bring-Jerrard polynomials given by P_n(z) = z^n-cz 1, \ c. For n=5, using the Tschirnhaus-Bring-Jerrard nonlinear transformations, this family controls, at least theoretically, the roots of all quintic polynomials. [...]
2014 - 10.5565/PUBLMAT_Extra14_05
Publicacions matemàtiques, Vol. Extra (2014) , p. 81-109
2 documents
3.
17 p, 827.7 KB On piecewise quadratic Newton and trust region problems / Sun, J.
Some recent algorithms for nonsmooth optimization require solutions to certain piecewise quadratic programming subproblems. Two types of subproblems are considered in this paper. The first type seeks the minimization of a continuously differentiable and strictly convex piecewise quadratic function subject to linear equality constraints. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 451-467  
 Accés restringit a la UAB
4.
19 p, 655.9 KB A preconditioning proximal Newton method for nondifferentiable convex optimization / Qi, Liqun ; Chen, Xiaojun
We propose a proximal Newton method for solving nondifferentiable convex optimization. This method combines the generalized Newton method with Rockafellar's proximal point algorithm. At each step, the proximal point is found approximately and the regularization matrix is preconditioned to overcome inexactness of this approximation. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 411-429  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.