Results 31 to 40 of about 713,971 (166)
Newton-type methods for stochastic programming
Mathematical and Computer Modelling, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the construction of minimisation methods of quasi-Newton type
Journal of Computational and Applied Mathematics, 1987 The paper investigates possibilities for the formulation of new quasi- Newton type methods. In doing so the so-called secant equation of the classical quasi-Newton algorithms is replaced by a more general equation. In this way it is possible to give a nonlinear approximation of the Newton equation, the solution of which corresponds to the Newton search
Ford, John A., Saadallah, Adel F.
openaire +1 more source
An Inexact Newton-Type Method for Inverse Singular Value [PDF]
, 2008 In this paper, an inexact Newton-type approach is proposed for solving inverse singu- lar value problems. We show that the method converges superlinearly.
白正简, Zheng-Jian Bai, Shufang Xu
core
A Newton Method for Linear Programming
, 2002 A fast Newton method is proposed for solving linear programs with a very large ( 106) number of constraints and a moderate ( 102) number of variables. Such linear programs occur in data mining and machine learning.
O. L. Mangasarian, Mangasarian, Olvi
core
Strongly interacting bumps for the schrodinger-newton equations
, 2009 We study concentrated bound states of the Schrodinger-Newton equations Moroz, Penrose and Tod proved the existence and uniqueness of ground states.
Winter, M, Wei, J
core
An adaptive Newton-method based on a dynamical systems approach
, 2014 The traditional Newton method for solving nonlinear operator equations in Banach spaces is discussed within the context of the continuous Newton method.
Amrein, Mario, Wihler, Thomas
core +1 more source
The Convergence of a Class of Parallel Newton-Type Iterative Methods [PDF]
Advances in Numerical Analysis, 2017 A general iterative process is proposed, from which a class of parallel Newton-type iterative methods can be derived. A unified convergence theorem for the general iterative process is established. The convergence of these Newton-type iterative methods is obtained from the unified convergence theorem.
openaire +2 more sources
A Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems [PDF]
, 2013 In this thesis we address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private convex cost and subject to communication constraints ...
Filippo Zanella, Zanella, Filippo
core
On two families of high order Newton type methods
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amat, S. +3 more
openaire +3 more sources
Complementarity Problems in GAMS and the PATH Solver
, 1998 A fundamental mathematical problem is to find a solution to a square system of nonlinear equations. There are many methods to approach this problem, the most famous of which is Newton?s method.
Ferris, Michael C. +5 more
core