Related papers: Application of a Generalized Secant Method to Nonl…
We propose a regularized Hessian-free Newton-type method for minimizing smooth convex functions with Lipschitz continuous Hessians. The algorithm constructs an approximate Hessian by finite differences and selects the regularization…
An implementation and an application of the combination of the genetic algorithm and Newton's method for solving a system of nonlinear equations is presented. The method first uses the advantage of the robustness of the genetic algorithm…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
In this paper, we propose a new and broadly applicable root-finding method, called as the upper-crossing/solution (US) algorithm, which belongs to the category of non-bracketing (or open domain) methods. The US algorithm is a general…
Motivated by the goal of improving the efficiency of small sample design, we propose a novel Bayesian stochastic approximation method to estimate the root of a regression function. The method features adaptive local modelling and…
We consider optimization problems in which the goal is find a $k$-dimensional subspace of $\mathbb{R}^n$, $k<<n$, which minimizes a convex and smooth loss. Such problems generalize the fundamental task of principal component analysis (PCA)…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
In this work we develop and analyze a semi-smooth Newton method for the general nonlinear conic programming problem. In particular, we study the problem with a generalized simplicial cone, i.e., the image of a symmetric cone under a linear…
A semi-local analysis of Newton's method for solving nonlinear inclusion problems in Banach space is presented in this paper. Under a affine majorant condition on the nonlinear function which is associated to the inclusion problem, the…
We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…
We consider the problem of solving linear least squares problems in a framework where only evaluations of the linear map are possible. We derive randomized methods that do not need any other matrix operations than forward evaluations,…
Approximating functions by a linear span of truncated basis sets is a standard procedure for the numerical solution of differential and integral equations. Commonly used concepts of approximation methods are well-posed and convergent, by…
We discuss the Simple Equations Method (SEsM) for obtaining exact solutions of nonlinear partial differential equations. We show that the Jacobi Elliptic Function Expansion Method, F-Expansion method, Modified Simple Equation method, Trial…
We propose a new globally convergent stochastic second order method. Our starting point is the development of a new Sketched Newton-Raphson (SNR) method for solving large scale nonlinear equations of the form $F(x)=0$ with $F:\mathbb{R}^p…
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…
In this work, by using techniques and results of differential geometry, we propose a new numerical method on complete Riemannian manifolds to find zeros of vector fields. Our algorithm generalizes the classical secant method
In this paper, we study iterative methods on the coefficients of the rational univariate representation (RUR) of a given algebraic set, called global Newton iteration. We compare two natural approaches to define locally quadratically…
Quasi-convex optimization acts a pivotal part in many fields including economics and finance; the subgradient method is an effective iterative algorithm for solving large-scale quasi-convex optimization problems. In this paper, we…
We propose and study a variant of the Dai-Liao spectral conjugate gradient method, developed through an analysis of eigenvalues and inspired by a modified secant condition. We show that our proposed method is globally convergent for general…
We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order…