Results 261 to 270 of about 11,812,491 (293)
Some of the next articles are maybe not open access.
A Smoothing Newton Method for General Nonlinear Complementarity Problems
Computational Optimization and Applications, 2000The paper deals with the nonlinear complementarity problem: to find \(x \in \mathbb{R}^n_+\) such that \(F(x) \geq 0\), \(x \geq 0\), \(x^TF(x)=0\), where \(F: \mathbb{R}^n\to \mathbb{R}^n\) is a continuously differentiable function. The authors consider the system: \(H= ( e^{\mu}-1 \Phi_{\mu} (x))^T\), where \(\Phi_{\mu}\) is defined by Kanzow's ...
Houduo Qi, Li-Zhi Liao
openaire +2 more sources
A Generalized Univariate Newton Method Motivated by Proximal Regularization
Journal of Optimization Theory and Applications, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Regina Sandra Burachik +2 more
openaire +1 more source
Newton's method and quasi-Newton—SQP method for general LC1 constrained optimization
Applied Mathematics and Computation, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Results on Newton methods. Part II: Perturbed Newton-like methods in generalized Banach spaces
Applied Mathematics and Computation, 1996[For part I see ibid. 74, No. 2-3, 119-141 (1996; reviewed above).] The author continues to concern himself with approximating a locally unique solution of a nonlinear operator equation in a generalized Banach space. He provides convergence results and error estimates for perturbed Newton-like methods, which generate an iteration that converges to a ...
openaire +2 more sources
Rate of convergence of a generalization of Newton's method
Journal of Optimization Theory and Applications, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benadada, Y. +2 more
openaire +2 more sources
Generalized Stirling-Newton Methods
1976In this contribution we generalize Newton’s method and related methods for the solution of fixed point problems. We replace the linear approximations to a given nonlinear operator which result from differentiability assumptions by arbitrary “tangent” mappings. Therefore our iteration algorithms apply to nondifferentiable operators.
openaire +1 more source
On a general iterative scheme for newton-type methods
Numerical Functional Analysis and Optimization, 1988A class of Newton-type iterative processes for solving nonlinear operator equations in Banach spaces is described by a general scheme, in which the approximate inverses of the derivatives are obtained recursively. Convergence conditions as well as error estimates are given. Some particular cases are finally discussed.
openaire +2 more sources
A Modified Generalized Newton Method for Absolute Value Equations
Journal of Optimization Theory and Applications, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the generation of updates for quasi-Newton methods
Journal of Optimization Theory and Applications, 1986We present a unified technique for updating approximations to Jacobian or Hessian matrices when any linear structure can be imposed. The updates are derived by variational means, where an operator-weighted Frobenius norm is used, and are finally expressed as solutions of linear equations and/or unconstrained extrema. A certain behavior of the solutions
openaire +2 more sources
Generalized Newton-Raphson method (GNR)
International journal of mathematical sciences, 2012We present a new method for solving a non-linear equation f(x)=0. The presented method is quadratically convergent, it converges faster than the classical Newton-Raphson method and the Newton- Raphson method appears as the limiting case of the presented method.
Sandrić, Nikola, Viher, Radimir
openaire +2 more sources

