Related papers: Comments on finite termination of the generalized …
New theorems about the existence of solution for a system of infinite linear equations with a Vandermonde type matrix of coefficients are proved. Some examples and applications of these results are shown. In particular, a kind of these…
For finite difference discretizations with linear complexity and provably convergent to weak solutions of the second boundary value problem for the Monge-Amp\`ere equation, we give the first proof of uniqueness. The boundary condition is…
Nielsen transformations form the basis of a simple and widely used procedure for solving word equations. We make progress on the problem of determining when this procedure terminates in the presence of length constraints. To do this, we…
The problem of minimizing a sum of local convex objective functions over a networked system captures many important applications and has received much attention in the distributed optimization field. Most of existing work focuses on…
The generalized symmetry method is applied to a class of completely discrete equations including the Adler-Bobenko-Suris list. Assuming the existence of a generalized symmetry, we derive a few integrability conditions suitable for testing…
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…
A convergence analysis is developed for the regularized Newton method for training neural networks (NNs) in the overparameterized limit. As the number of hidden units tends to infinity, the NN training dynamics converge in probability to…
In this work, we show that several problems naturally represented as Nonlinear Absolute Value Equations (NAVE) can be reformulated as Nonlinear Complementarity Problems (NCP) and efficiently solved using smoothing regularization techniques…
The nonlinear systems obtained by discretizing degenerate parabolic equations may be hard to solve, especially with Newton's method. In this paper, we apply to Richards equation a strategy that consists in defining a new primary unknown for…
In this paper, we investigate the strong maximum principle for generalized solutions of Monge-Amp\`ere type equations. We prove that the strong maximum principle holds at points where the function is strictly convex but not necessarily…
A global approximation method of Nystr\"om type is explored for the numerical solution of a class of nonlinear integral equations of the second kind. The cases of smooth and weakly singular kernels are both considered. In the first…
The paper starts with a concise description of the recently developed semismooth* Newton method for the solution of general inclusions. This method is then applied to a class of variational inequalities of the second kind. As a result, one…
This study proposes a cubic regularization of the Newton method for generating weakly efficient points of unconstrained vector optimization problems under no convexity assumption on the objective function. It is observed that at a given…
We study a PDE-constrained optimal control problem that involves functions of bounded variation as controls and includes the TV seminorm of the control in the objective. We apply a path-following inexact Newton method to the problems that…
We reformulate the Generalized Proudman--Johnson (GPJ) equation with parameter a in Lagrangian variables, where it takes the form of an inhomogeneous Liouville equation. This allows us to provide an explicitformula for the flow map, up to…
Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their…
In this paper, an idea to solve nonlinear equations is presented. During the solution of any problem with Newton's Method, it might happen that some of the unknowns satisfy the convergence criteria where the others fail. The convergence…
In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…
In this paper a special piecewise linear system is studied. It is shown that, under a mild assumption, the semi-smooth Newton method applied to this system is well defined and the method generates a sequence that converges linearly to a…