An asynchronous parallel Newton method
From MaRDI portal
A parallel Newton method is described for the minimization of a twice continuously differentiable uniformly convex function F(x). The algorithm generates a sequence \(\{x_ j\}\) which converges superlinearly to the global minimizer of F(x).
Recommendations
- A parallel asynchronous Newton algorithm for unconstrained optimization
- Parallel stochastic Newton method
- Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations
- ASYNCHRONOUS MONOTONE NEWTON ITERATIVE METHOD ON DISTRIBUTED COMPUTERS
- Parallel Newton-Raphson methods for unconstrained minimization with asynchronous updates of the Hessian matrix or its inverse
- A Fast Distributed Asynchronous Newton-Based Optimization Algorithm
- Convergence and numerical results for a parallel asynchronous quasi- Newton method
- Parallelism in structured Newton computations
- scientific article; zbMATH DE number 1247173
- An asynchronous parallel method for linear systems
Cites work
Cited in
(11)- Parallel Newton methods for the nonlinear complementarity problem
- Automatic differentiation of characterizing sequences
- A parallel asynchronous Newton algorithm for unconstrained optimization
- A concept of nonlinear block diagonal dominance
- Convergence and numerical results for a parallel asynchronous quasi- Newton method
- Parallelism in structured Newton computations
- Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations
- Parallel Newton-Raphson methods for unconstrained minimization with asynchronous updates of the Hessian matrix or its inverse
- Parallel stochastic Newton method
- scientific article; zbMATH DE number 278839 (Why is no real title available?)
- Block truncated-Newton methods for parallel optimization
This page was built for publication: An asynchronous parallel Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116895)