An improved approximate Newton method for implicit Runge–Kutta formulas
نویسندگان
چکیده
منابع مشابه
GIANT: Globally Improved Approximate Newton Method for Distributed Optimization
For distributed computing environments, we consider the canonical machine learning problem of empirical risk minimization (ERM) with quadratic regularization, and we propose a distributed and communication-efficient Newton-type optimization method. At every iteration, each worker locally finds an Approximate NewTon (ANT) direction, and then it sends this direction to the main driver. The driver...
متن کاملAn improved inexact Newton method
For unconstrained optimization, an inexact Newton algorithm is proposed recently, in which the preconditioned conjugate gradient method is applied to solve the Newton equations. In this paper, we improve this algorithm by efficiently using automatic differentiation and establish a new inexact Newton algorithm. Based on the efficiency coefficient defined by Brent, a theoretical efficiency ratio ...
متن کاملAn Approximate Quasi-Newton Bundle-Type Method for Nonsmooth Optimization
and Applied Analysis 3 rate of convergence under some additional assumptions, and it should be noted that we only use the approximate values of the objective function and its subgradients which makes the algorithm easier to implement. Some notations are listed below for presenting the algorithm. (i) ∂f(x) = {ξ ∈ Rn | f(z) ≥ f(x) + ξT(z − x), ∀z ∈ R}, the subdifferential of f at x, and each such...
متن کاملAn improved generalized Newton method for absolute value equations
In this paper, we suggest and analyze an improved generalized Newton method for solving the NP-hard absolute value equations [Formula: see text] when the singular values of A exceed 1. We show that the global and local quadratic convergence of the proposed method. Numerical experiments show the efficiency of the method and the high accuracy of calculation.
متن کاملFast Kernel ICA using an Approximate Newton Method
Recent approaches to independent component analysis (ICA) have used kernel independence measures to obtain very good performance, particularly where classical methods experience difficulty (for instance, sources with near-zero kurtosis). We present fast kernel ICA (FastKICA), a novel optimisation technique for one such kernel independence measure, the Hilbert-Schmidt independence criterion (HSI...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2011
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.05.027