scholarly journals A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method

2022 ◽  
pp. 90-102
Author(s):  
Miriam Schlöter ◽  
Martin Skutella ◽  
Khai Van Tran
Keyword(s):  
Newton Method

Electromagnetic subsurface prospecting by a fully nonlinear multifocusing inexact Newton method

2014 ◽  
Vol 31 (12) ◽  
pp. 2618 ◽  
Author(s):  
Marco Salucci ◽  
Giacomo Oliveri ◽  
Andrea Randazzo ◽  
Matteo Pastorino ◽  
Andrea Massa
Keyword(s):  
Newton Method ◽  
Inexact Newton Method ◽  
Fully Nonlinear

The Improvement of Newton Method and the Validation of Optimization Idea of Blind Walking Repeatedly

2011 ◽  
Vol 250-253 ◽  
pp. 4061-4064
Author(s):  
Chun Ling Zhang
Keyword(s):  
Saddle Point ◽  
Newton Method ◽  
Optimization Problem ◽  
Initial Point ◽  
Optimization Method ◽  
Maximum Point ◽  
Optimal Result ◽  
Feasible Domain ◽  
Parallel Arithmetic ◽  
Newton Direction

The existence of maximum point, oddity point and saddle point often leads to computation failure. The optimization idea is based on the reality that the optimum towards the local minimum related the initial point. After getting several optimal results with different initial point, the best result is taken as the final optimal result. The arithmetic improvement of multi-dimension Newton method is improved. The improvement is important for the optimization method with grads convergence rule or searching direction constructed by grads. A computational example with a saddle point, maximum point and oddity point is studied by multi-dimension Newton method, damped Newton method and Newton direction method. The importance of the idea of blind walking repeatedly is testified. Owing to the parallel arithmetic of modernistic optimization method, it does not need to study optimization problem with seriate feasible domain by modernistic optimization method.

scholarly journals Robust Iterative Solvers for Gao Type Nonlinear Beam Models in Elasticity

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
B. Borsos ◽  
János Karátson
Keyword(s):  
Finite Element ◽  
Newton Method ◽  
Newton's Method ◽  
Numerical Experiments ◽  
Elliptic Problems ◽  
Iterative Solvers ◽  
Finite Element Solution ◽  
Element Solution ◽  
Nonlinear Beam ◽  
Quasi Newton

Abstract The goal of this paper is to present various types of iterative solvers: gradient iteration, Newton’s method and a quasi-Newton method, for the finite element solution of elliptic problems arising in Gao type beam models (a geometrical type of nonlinearity, with respect to the Euler–Bernoulli hypothesis). Robust behaviour, i.e., convergence independently of the mesh parameters, is proved for these methods, and they are also tested with numerical experiments.

Sign in / Sign up

Export Citation Format

Share Document