Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Algorithme de Newton"'
Publikováno v:
[Research Report] Inria Paris; Université de Sherbrooke (Québec, Canada). 2023, pp.43
The semismooth Newton method is a very efficient approach for computing a zero of a large class of nonsmooth equations. When the initial iterate is sufficiently close to a regular zero and the function is strongly semismooth, the generated sequence c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::bdc1327a43a8da989f3a0dff0d6a0a25
https://hal.science/hal-04097624/document
https://hal.science/hal-04097624/document
Publikováno v:
[Research Report] Inria Paris; Université de Sherbrooke (Québec, Canada). 2023, pp.32
[Research Report] Inria Paris; Université de Sherbrooke (Québec, Canada). 2019
[Research Report] Inria Paris; Université de Sherbrooke (Québec, Canada). 2019
The semismooth Newton method is a very efficient approach for computing a zero of a large class of nonsmooth equations. When the initial iterate is sufficiently close to a regular zero and the function is strongly semismooth, the generated sequence c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a1b2f9ad959ada558e4eab582c58a2cb
https://hal.science/hal-02306526
https://hal.science/hal-02306526
Publikováno v:
[Research Report] Inria Paris; Université de Sherbrooke (Québec, Canada). 2019
The semismooth Newton method is a very efficient approach for computing a zero of a large class of nonsmooth equations. When the initial iterate is sufficiently close to a regular zero and the function is strongly semismooth, the generated sequence c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::a1b2f9ad959ada558e4eab582c58a2cb
https://hal.archives-ouvertes.fr/hal-02306526
https://hal.archives-ouvertes.fr/hal-02306526
Publikováno v:
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
SIAM Journal on Matrix Analysis and Applications, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
SIAM Journal on Matrix Analysis and Applications, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
International audience; The paper "An algorithmic characterization of P-matricity" (SIAM Journal on Matrix Analysis and Applications, 34:3 (2013) 904–916, by the same authors as here) implicitly assumes that the iterates generated by the Newton-min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22645a4c643b024523e3b094111b6014
https://doi.org/10.1137/18m1168522
https://doi.org/10.1137/18m1168522
Publikováno v:
EURO Journal on Computational Optimization
EURO Journal on Computational Optimization, Springer, 2019, 7 (4), pp.22. ⟨10.1007/s13675-019-00116-6⟩
EURO Journal on Computational Optimization, Springer, 2019, 7 (4), pp.22. ⟨10.1007/s13675-019-00116-6⟩
International audience; The plain Newton-min algorithm for solving the linear complementarity problem (LCP) 0 ≤ x ⊥ (Mx+q) ≥ 0 can be viewed as an instance of the plain semismooth Newton method on the equational version min(x,Mx+q) = 0 of the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::4978666245b529fbc2a6a93211c7780f
https://hal.inria.fr/hal-01806399v2/document
https://hal.inria.fr/hal-01806399v2/document
Autor:
Rakotondrandisa, Aina
Nous développons dans ce travail de thèse un outil de simulation numérique pour les matériaux à changement de phase (MCP), en tenant compte du phénomène de convection naturelle dans la phase liquide, pour des configurations en deux et trois di
Externí odkaz:
http://www.theses.fr/2019NORMR051/document
Publikováno v:
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
International audience; The paper "An algorithmic characterization of P-matricity" (SIAM Journal on Matrix Analysis and Applications, 34:3 (2013) 904–916, by the same authors as here) implicitly assumes that the iterates generated by the Newton-min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::fe600b3c4fecd381e46323c0d4367389
https://hal.inria.fr/hal-01672197
https://hal.inria.fr/hal-01672197
Autor:
Rakotondrandisa, Aina
In this thesis we develop a numerical simulation tool for computing two and three-dimensional liquid-solid phase-change systems involving natural convection. It consists of solving the incompressible Navier-Stokes equations with Boussinesq approximat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::36093bbbb49e3f79a743e47d6e46131e
https://theses.hal.science/tel-02349536
https://theses.hal.science/tel-02349536
Autor:
Gilbert, Jean Charles
This course starts with the presentation of the optimality conditions of an optimization problem described in a rather abstract manner, so that these can be useful for dealing with a large variety of problems. Next, the course describes and analyzes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::cdb8365465f7304be61190b7db4dccc3
https://hal.inria.fr/cel-01249369v3
https://hal.inria.fr/cel-01249369v3
Publikováno v:
[Research Report] INRIA Paris. 2018, pp.19
The plain Newton-min algorithm can be viewed as an instance of the plain semismooth Newton method on the equational version min(x,Mx+q) = 0 of the linear complementarity problem (LCP) $"0 ≤ x ⊥ (Mx+q) ≥ 0"$. This algorithm converges, whatever i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::03c54adac976c4e6d7c8d48eb9c4fcd3
https://hal.inria.fr/hal-01806399
https://hal.inria.fr/hal-01806399